Systems and methods for document sorting

ABSTRACT

Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of and claims prioritybenefit of co-pending and commonly-owned to U.S. patent application Ser.No. 14/614,318, entitled “USING ANCHOR POINTS IN DOCUMENTIDENTIFICATION,” filed on Feb. 4, 2015, and listing Michael J. Ebaughand Matthew J. Morvant as inventors, which is scheduled to issue as U.S.Pat. No. 9,754,017 on Sep. 9, 2017, which is a continuation applicationof and claims priority to U.S. patent application Ser. No. 13/718,822,entitled “DOCUMENT INDEXING,” filed on Dec. 18, 2012, and listingMichael J. Ebaugh and Matthew J. Morvant as inventors, which issued asU.S. Pat. No. 8,954,470 on Feb. 10, 2015, which is a divisional of andclaims priority to U.S. patent application Ser. No. 13/335,597, entitled“SYSTEMS AND METHODS FOR DATA INDEXING AND PROCESSING,” filed on Dec.22, 2011, and listing Michael J. Ebaugh and Matthew J. Morvant asinventors, which issued as U.S. Pat. No. 8,370,387 on Feb. 5, 2013,which is a continuation application of and claims priority to U.S.patent application Ser. No. 11/486,475, entitled “SYSTEMS AND METHODSFOR DATA INDEXING AND PROCESSING,” filed on Jul. 14, 2006, listingMichael J. Ebaugh and Matthew J. Morvant as inventors, which issued asU.S. Pat. No. 8,112,441 on Feb. 7, 2012, which claimed priority under 35USC §119(e) to U.S. Provisional Application Ser. No. 60/699,893,entitled “SYSTEM, COMPUTER SOFTWARE PRODUCT AND METHOD OF PROCESSINGDATA CONTAINED IN PHYSICAL OR ELECTRONIC MEDIA,” filed Jul. 15, 2005.The contents of each patent document are incorporated in their entiretyherein by reference.

This application is related to commonly assigned U.S. patent applicationSer. No. 11/487,021, filed on Jul. 14, 2006, entitled “SYSTEMS ANDMETHODS FOR DATA INDEXING AND PROCESSING,” listing Michael J. Ebaugh andMatthew J. Morvant as inventors (Attorney Docket No. 20030-1187), whichissued as U.S. Pat. No. 7,860,844 on Dec. 28, 2010, the contents ofwhich are incorporated herein by reference.

BACKGROUND Field of the Invention

The present invention relates generally to the field of data processing,and more particularly to systems and methods for data processing anddata indexing.

Background of the Invention

Many individuals and business entities have to process documents andelectronic files. For example, medical facilities are continuallyinundated with lab reports, medical transcriptions, test results,insurance forms, and the like. Stores and other business must maintaininformation related to products, inventory, customers, vendors,employees, and so forth.

Traditionally, much of the processing of this information, whethercontained in physical media, such as paper, or electronic files storedon electronic media, such as magnetic disks, optical disks, flashmemory, network servers, storage devices, and the like, is donemanually. That is, the information contained on physical or electronicmedia is manually reviewed and manually indexed or processed.

The amount of time required to review the data contained in physical orelectronic media and to catalogue the information contained thereinoften consumes a large portion of the time. Increasing the accuracy ofcataloguing of these records and documents generally results inincreasing the time spent reviewing and processing.

Some prior methods attempt to increase accuracy but decrease timeinvolved in processing data used automated systems. One such systeminvolves entry of information, at least in part, by using barcodes,predefined fields, or optical marks indicia imprinted or placed on apaper-based form. The barcode or marks are scanned to enter informationinto a database. However, such systems are not without problems. Thesemethods are heavily dependent on the direct activities of theprofessional staff or organization providing services. To be effective,these methods require consistent and accurate usage by the staff ororganization. In some instances, barcodes, predefined fields, or opticalmarks systems still required manual, labor-intensive processes.Furthermore, barcode or optical mark systems often do not work acrossdifferent entities, as it requires consistent adoption of uniformprocedures and infrastructure by all the entities. That is, the markingsof one entity are often not useful to another entity.

Currently, no systems or methods allow for the automated input andprocessing of information from various documents received from aplurality of sources. Accordingly, systems and methods are needed thatallow indicia contained within data, which may be originally embodied inphysical or electronic media, to be identified and processed withoutextensive professional staff assistance.

BRIEF DESCRIPTION OF THE DRAWINGS

Reference will be made to embodiments of the invention, examples ofwhich may be illustrated in the accompanying figures. These figures areintended to be illustrative, not limiting. Although the invention isgenerally described in the context of these embodiments, it shall beunderstood that the scope of the invention is not limited to theseparticular embodiments.

FIG. 1 illustrates an exemplary environment in which embodiments ofsystems and methods of the present invention may operate.

FIG. 2 is a functional block diagram illustrating an exemplarymulti-computing-device system in which exemplary embodiments of thepresent invention may operate.

FIG. 3 depicts an exemplary computing system according to an embodimentof the present invention.

FIG. 4A depicts an exemplary laboratory report which may be embodied ina document file according to an embodiment of the invention.

FIG. 4B depicts an exemplary reference database according to anembodiment of the present invention.

FIG. 5 depicts an exemplary method for initially accessing an indexingservice provider system according to an embodiment of the invention.

FIG. 6 depicts an exemplary method for processing a document file orfiles according to an embodiment of the present invention.

FIG. 7 depicts an exemplary method for transferring a document file orset of document files from a client system to an indexing serviceprovider system according to an embodiment of the present invention.

FIG. 8 depicts an exemplary method for decrypting andextracting/decompressing a received batch of document files according toan embodiment of the present invention.

FIG. 9 depicts an exemplary method for extracting data from a documentfile according to an embodiment of the present invention.

FIG. 10 depicts an exemplary method for extracting characters from adocument file according to an embodiment of the present invention.

FIG. 11 depicts an exemplary method for checking the extraction ofcharacters from a document file according to an embodiment of thepresent invention.

FIG. 12A depicts an exemplary plurality of characters obtained from adocument file according to an embodiment of the present invention.

FIG. 12B depicts exemplary arrays of strings obtained from a documentfile according to an embodiment of the present invention.

FIG. 13 depicts an exemplary method for indexing a document fileaccording to an embodiment of the present invention.

FIG. 14 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 15 depicts an exemplary method for determining a document type of adocument file according to an embodiment of the present invention.

FIG. 16 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 17 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 18 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 19 depicts an exemplary method for determining a date of service ofa document file according to an embodiment of the present invention.

FIG. 20 depicts an embodiment of a method for determining a date ofservice for a document file according to an embodiment of the presentinvention.

FIG. 21 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 22 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention.

FIG. 23 depicts an exemplary method for determining a providerassociated with a document file according to an embodiment of thepresent invention.

FIG. 24 depicts an exemplary method for indexing a document fileaccording to an embodiment of the present invention.

FIG. 25 depicts an exemplary method for returning information related toprocessed document files to a client system according to an embodimentof the present invention.

FIG. 26 depicts exemplary types of information that may be associatedwith a document file according to an embodiment of the presentinvention.

FIG. 27 illustrates an exemplary composite message according to anembodiment of the present invention.

FIG. 28 depicts an exemplary method for presenting files for manualreview according to an embodiment of the present invention.

FIG. 29 depicts an exemplary method for receiving and processingdocument files received from an indexing service provider according toan embodiment of the present invention.

FIG. 30 graphically illustrates an exemplary file structure for indexinga plurality of files according to an embodiment of the presentinvention.

DETAILED DESCRIPTION OF THE INVENTION

According to an aspect of the present invention, systems and methods aredisclosed that allow for the automated indexing and/or processing ofinformation from a variety of documents, both from physical media andelectronic media, which may be received from a plurality of sources.Although the features and advantages of the invention are generallydescribed in this section in the context of embodiments, it shall beunderstood that the scope of the invention should not be limited tothese particular embodiments. Many additional features and advantageswill be apparent to one of ordinary skill in the art in view of thedrawings, specification, and claims hereof.

In the following description, for purposes of explanation, specificdetails are set forth in order to provide an understanding of theinvention. It will be apparent, however, to one skilled in the art thatthe invention can be practiced without these details. One skilled in theart will recognize that embodiments of the present invention, describedbelow, may be performed in a variety of ways and using a variety ofmeans and should not be construed as limited to the embodiments setforth herein. Rather, these embodiments are provided so that thisdisclosure will convey the scope of the invention to those skilled inthe art. Those skilled in the art will also recognize additionalmodifications, applications, and embodiments are within the scopethereof, as are additional fields in which the invention may provideutility.

The embodiments of the present invention may be present in software,hardware, firmware, or combinations thereof. Structures and devicesshown in block diagram are illustrative of exemplary embodiments and aremeant to avoid obscuring the invention. Furthermore, connections betweensystems, services, components, and/or modules within the figures are notintended to be limited to direct connections. Rather, data between thesesystems, services, components, and/or modules may be modified,re-formatted, or otherwise changed by intermediary systems, services,components, and/or modules.

Reference in the specification to “one embodiment” or “an embodiment”means that a particular feature, structure, characteristic, or functiondescribed in connection with the embodiment is included in at least oneembodiment of the invention. Furthermore, the appearance of the phrase“in one embodiment,” “in an embodiment,” or the like in various placesin the specification are not necessarily all referring to the sameembodiment.

A. Exemplary System in which Embodiments of the Present Invention mayOperate

FIG. 1 graphically depicts an exemplary environment in which systems andmethods of the present invention may operate. FIG. 1 depicts a medicalenvironment 050 in which a physician's office 010 receives information,in the form of electronic or physical files, from a plurality of sources020. Those sources 020 may include, but are not limited to, hospitals020A, patients 020B, government agencies 020C, insurance companies 020D,previous caregivers 020E, and laboratories 020F. It shall be noted thatthe present invention is not limited to use within medical systems, butmay be employed in other settings, including without limitation,governmental, business, non-profit, and educational environments.

As noted previously, a physician's office may receive a number of filesfrom a number of sources 020. The physician's office 010 must processall of these files received from the multiple sources. Processing thesefiles has typically been performed by hand, or at least principally byhand, which requires huge amounts of time and expense.

As illustrated in FIG. 1, an indexing service provider 030,communicatively connected with the physician's office 010, may beemployed to automate the processing of the plurality of files receivedby the physician's office according to embodiments of the presentinvention. In the embodiment depicted in FIG. 1, the indexing serviceprovider 030 may be functionally and/or physically located in anotherlocation separate from the physician's office 010; alternatively, theindexing service provider may be functionally and/or physically locatedat the physician's office 010.

FIG. 2 is a functional block diagram illustrating an exemplarymulti-computing-device system 200 in which exemplary embodiments of thepresent invention may operate. It shall be noted that the presentinvention may operate, and be embodied in, other systems as well.

Depicted in FIG. 2 is a first computer system or device 101 and a secondcomputing device or system 201 communicatively connected to the firstcomputer system 101. As will be apparent to those skilled in the art,first and second computing systems may be configured to communicatedirectly or may communicate indirectly via one or more intermediatecomputing devices. In an embodiment, in addition to being capable ofbeing coupled in a variety of different manners, the first and secondcomputing devices may communicate by any of a number of differentcommunications protocols, including, but not limited to, standardnetworking and Internet communication protocols.

In an embodiment, first computing device 101 and second computing device201 may be owned or operated by a single entity or may be housed withina single facility. Alternatively, first computing devices 101 and secondcomputing device 201 may be owned or operated by separate entities ormay be housed in separate facilities. For example, first computingdevice 101 may be located at a physician's office 010, such as the onedepicted in FIG. 1, and the second computing device 201 may be operatedby a service provider 030.

In an embodiment, first computing system 101 and second computing device201 may comprise one or more services, or modules, to performoperations. These modules may be communicatively coupled together toperform the described operations or achieve the described results. Itshall be noted that the terms “coupled” or “communicatively coupled,”whether used in connection with modules, devices, or systems, shall beunderstood to include direct connections, indirect connections throughone or more intermediary devices, and wireless connections. It shallalso be understood that throughout this discussion that services ormodules may be described as separate functional units, but those skilledin the art will recognize that the various services, or portionsthereof, may be divided into separate services or modules or may beintegrated together, including integrating within a single computingsystem. One skilled in the art will also recognize that a service ormodule may be implemented in software, hardware, firmware, or acombination thereof. The term “services” may also be usedinterchangeably herein with “utilities” or “modules.”

The embodiment of first computing system 101 depicted in the FIG. 2 maycomprises a database interface 102 for interfacing with one or moredatabases 100 or database systems 110, and a communication servicesmodule 103. First computing system 101 may comprise fewer or additionalservices or modules to accomplish tasks illustrated by the embodimentsdescribed herein.

Second computing system 201 may comprise a database interface 202 forinterfacing with one or more databases or database systems; acommunications services module 203, which may communicate with otherdevices, systems, and/or applications and may include messagingservices, encryption/decryption, compression/extracting services, and/orpackaging services; unpack services 204, which may include unpackingbatch files received from the first computing system; extractionservices 205, which may include optical and/or voice recognitionservices, rotation utilities, and text verification services; indexingservices 206, which may include one or more matching/filteringalgorithms and may also include manual indexing functionality;observation services 207, which may take certain actions based uponobservation made within a document file; messaging service 208, whichmay be part of or separate from communications services 203, forproviding messages to indexing recipients, clients, and/or thirdparties; archiving and retrieval services 209 for providing data back-upfor an indexing recipient; packaging services 210, which also may bepart of communications services 203, for preparing files fortransmission to an indexing recipient; and account and billing services211, which may monitor indexing recipient's account(s) and providebilling when billing events have transpired. Additional informationabout these services is provided herein with description of the variousembodiments.

One skilled in the art will recognize that these services may beintegrated into a single computer system. One skilled in the art willalso recognize that some services, such as packaging and unpackingservices may not be needed in single computing system embodiments. Itshall also be noted that other systems and services may be configuredand fall within the scope of the present invention.

First and/or second computing devices 101, 201 may be a generalcomputing device, including, without limitation, a workstation, server,personal computer, and the like, or may be a specifically designedcomputing device. It shall be noted that employing one or more secondcomputing systems 201 may be beneficial to reduce the processing andbandwidth loading on first computing system 101. In an embodiment,second computing system 201 may be communicatively coupled to databasesystem 110. Alternatively, second computing system 201 may receiveaccess to or receive files from database system 110 via first computingsystem 101. Although not depicted in FIG. 2, one skilled in the art willrecognize that second computing system 201 may be communicativelycoupled to the same or similar devices, inputs, and networks that arecommunicatively coupled to first computing device 101, which aredescribed in more detail below. It shall be noted that the presentinvention may operate, and be embodied in, other systems as well.

In an embodiment, an aspect of the present invention is indexing and/orprocessing of data received by first computing device 101. At one ormore instances of time, first computing system 101 may receive data fromone or more of the sources of data. The data in files received by firstcomputing system 101 may be originally embodied in electronic files orin physical media, such as paper reports and the like. Examples ofreceived document files include, but are not limited to, faxes, papers,letters, email messages, instant messages, data files, text files,document files, HL-7 messages, ASTM message, mark-up language files,image files, audio files, and the like. In some instances, a receiveddocument file directly representative of the data contained in thephysical or electronic media. For example, the data representing an HL-7file directly represents the data of interest. In embodiments, thereceived document file indirectly represents the data contained inphysical or electronic media. For example, the document file mayrepresent an image of a report rather than the report data itself. Asexplained in more detail with reference to extraction services, dataextraction may assist in extracting at least some of the plurality ofcharacters for such received document files. For example, opticalcharacter recognition operations may assist in extracting some or all ofthe plurality of characters from a file. In either event, the documentfile may be associated with a plurality of characters. For the purposesof explanation, a file received by first computing system 101 forprocessing may be referred to herein as a document file. It shall beunderstood that the term “document file” refers to any file, regardlessof the contents or type of data contained within or associated with thefile, which is to be processed according to one or more embodiments ofthe present invention. That is, the file may not contain data associatedwith a “document,” but for the purposes of explanation herein, it may bereferred to as a “document file.”

Regardless of its original form, a file may contain a plurality ofcharacters, which may form identifying indicia that are useful forindexing and/processing a document file. Identifying indicia mayinclude, but are not limited to, first name, last name, account number,social security number, date of birth, document title, document type,document contents, identification number, product number, stock keepingunit (SKU) number, file type, file structure, file source, file name,document identification number, document source, transmissioninformation, encryption information (such as key encryption, hash, andthe like), hash number, metadata, and any other information useful foridentifying, categorizing, or processing a document file.

Consider, by way of example, the report 400 illustrated in FIG. 4A. Thereport 400 may be represented in an electronic file. Report 400comprises a plurality of characters, which one or more portions of theplurality of characters may be used for processing the report 400. Itshould be noted that the plurality of characters are not limited to thedata appearing on the face of a report or form. Rather, the plurality ofcharacters shall be construed to include any information associated withthe document file, which also includes any data or information usefulfor identifying, categorizing, or processing the file. Examples of theplurality of characters, in addition to the information included uponthe face of the document, that may be associated with the file may alsoinclude, but are not limited to, file type, file source, file structure,file name, transmission information, encryption information (such as keyencryption, hash, and the like), hash number, metadata, and the like.

Returning to FIG. 2, in an embodiment, first computer system 101 isadapted to receive document files for processing. As depicted in theembodiment illustrated in FIG. 2, first computing system 101 may becommunicatively coupled to receive data in a variety of manners and froma variety of sources. In an embodiment, first computing device 101 maycommunicate according to any of a variety of communications protocols,including, but not limited to, standard networking and Internetcommunications protocols.

In an embodiment, first computing device 101 may communicate wirelessly,such as by means of a wireless local area network (LAN) or a wirelesswide area network (WAN), with one or more networks or devices, such asremote network 150 and mobile device 155. Mobile device may comprise oneor more mobile or wireless computing device, including, but not limitedto, a laptop computer, a mobile phone, a PDA, a wireless communicationdevice, and the like. Alternatively, or in addition to the wirelessconnections, first computing system 101 may be connected via a wiredLAN, wired WAN, or by any other wired connection, including but notlimited to universal serial bus (USB), firewire, serial, and parallelport connections, to one or more devices or networks, such as to network145 or to one or more storage devices 140. Storage devices include, butare not limited to, optical drives, disk drives, tape drives, flashmemory drives, RAID arrays, and the like. Data may be received from anetwork 145, 150, and/or storage device 140. In an embodiment, network145, 150 may provide access one or more of the following: intranets,extranets, portals, the Internet, and one or more information servers.Examples of information servers include, but are not limited to, atranscription information server, a medical information server, alaboratory information server, an email server, databases, or any otherdata source known to those skilled in the art.

In an embodiment, first computing system 101 may be connected to one ormore input devices 115. For example, first computing system 101 mayreceive data via a keyboard, touchpad, mouse, or the like. Firstcomputing system may also receive data via an audio/video input. Anaudio input may be recorded and manually transcribed or may betranscribed using speech recognition software or hardware, which may beresident within system 101 or system 201.

In an embodiment, first computing system 101 may also be communicativelycoupled to other input devices. In one embodiment, a scanner 125 mayprovide data to first computing system 101, which data may be a digitalrepresentation of physical media, such as handwritten, typed, or printeddocuments. First computing system 101 may also be communicativelycoupled to a fax machine and/or fax server 120 to receive facsimiledata. In an embodiment, the scanned or faxed file may be an image of thephysical media. In an alternative embodiment, the scanned or faxed datamay include text and/or graphical data. Embodiments of the presentinvention may include a bar code reader and/or optical mark reader 135.A barcode or optical mark indicia imprinted or placed on an item, whenscanned, may provide data to first computing system 101.

First computing system 101 may include a directory interface 102 forcommunicating with a directory or database system 110. In oneembodiment, database system 110 may be implemented using Centricity EMR®(formerly Logician®), an electronic medical record system marketed by GEHealthcare. In an embodiment, database system 110 may be located on alocal storage device, such as a hard drive. In an alternativeembodiment, database system 110 may be stored remotely and accessed byfirst computing system 101 via a direct or networked connection.

In an embodiment, database system 110 may include one or more databases.In an embodiment, database system 110 stores data that has been receivedby first computing system 101. In one embodiment, database system 110possesses a database 100, which includes a plurality of recordscomprising one or more sets of data, such as identifying indicia, thatmay be used as a comparison reference database, as explained in moredetail below. FIG. 4B depicts an exemplary database comprising aplurality of records 410, which comprise a plurality of data fields 405.Database 100 or database system 110 may also include one or more of thefollowing: additional identifying indicia, instructions for processingcertain data, composite data, or other data. In an embodiment, anydatabase stored in database system 110 may be selectively queried. Forexample, reference database 100 may be queried using one or more keyterms or identifying indicia, which may include but is not limited to,an account number, an individual's name, data of birth (DOB), socialsecurity number, item number, stock keeping unit (SKU) number, reportdata, associated provider, and the like.

Exemplary Computing Systems

In an embodiment, first computer system 101, second computing system201, or both may be implemented using a conventional computing device,such as a personal computer, a workstation, a server, a portablecomputing device, such as a laptop computer or a PDA-type (personal dataassistant) device, or the like. Alternatively, first computing device101, second computing device 201, or both may be a specifically designedor configured computing device. FIG. 3 is a functional block diagram ofan embodiment of a computing system 300 that may be used for firstcomputing device 101, second computing device 201, or both.

As illustrated in FIG. 3, a processor 302 executes software instructionsand interacts with other system components. In an embodiment, processor302 may be a general purpose processor such as an AMD processor, anINTEL x86 processor, a SUN MICROSYSTEMS SPARC, or a POWERPCcompatible-CPU, or the processor may be an application specificprocessor or processors. A storage device 304, coupled to processor 302,provides long-term storage of data and software programs. Storage device304 may be a hard disk drive and/or another device capable of storingdata, such as a computer-readable media (e.g., diskettes, tapes, compactdisk, DVD, and the like) drive or a solid-state memory device. Storagedevice 304 may hold programs, instructions, and/or data for use withprocessor 302. In an embodiment, programs or instructions stored on orloaded from storage device 304 may be loaded into memory 306 andexecuted by processor 302. In an embodiment, storage device 304 holdsprograms or instructions for implementing an operating system onprocessor 302. In one embodiment, possible operating systems include,but are not limited to, UNIX, AIX, LINUX, Microsoft Windows, and theApple MAC OS. The operating system executes on, and controls theoperation of, the computing system 300.

An addressable memory 306, coupled to processor 302, may be used tostore data and software instructions to be executed by processor 302.Memory 306 may be, for example, firmware, read only memory (ROM), flashmemory, non-volatile random access memory (NVRAM), random access memory(RAM), or any combination thereof. In one embodiment, memory 306 storesa number of software objects, otherwise known as services, utilities, ormodules. One skilled in the art will also recognize that storage 204 andmemory 206 may be the same items and function in both capacities.

In an embodiment, computing system 300 provides the ability tocommunicate with other devices, other networks, or both. Computingsystem 300 may include one or more network interfaces or adapters 312,314 to communicatively couple computing system 300 to other networks anddevices. For example, computing system 300 may include a networkinterface 312, a communications port 314, or both, each of which arecommunicatively coupled to processor 302, and which may be used tocouple computer system 300 to other computer systems, networks, anddevices.

In an embodiment, computing system 300 may include one or more outputdevices 308, coupled to processor 302, to facilitate displaying graphicsand text. Output devices 308 may include, but are not limited to, adisplay, LCD screen, CRT monitor, printer, touch screen, or other devicefor displaying information. Computing system 300 may also include agraphics adapter (not shown) to assist in displaying information orimages on output device 308.

One or more input devices 310, coupled to processor 302, may be used tofacilitate user input. Input device 310 may include, but are not limitedto, a pointing device, such as a mouse, trackball, or touchpad, and mayalso include a keyboard or keypad to input data or instructions intocomputing system 300. In an embodiment, one or more of the input devices210 may be the same as input device 115 (FIG. 2).

One skilled in the art will recognize no computing system is critical tothe practice of the present invention. One skilled in the art will alsorecognize that a number of the elements described above may be physicaland/or functionally separated into sub-modules or combined together.

Embodiments of File Acquisition Services and Account Validation

In an embodiment, the present invention may include file acquisitionservices and/or account validation services. FIG. 5 depicts an exemplarymethod for file acquisition services (505) and account login (515) for aclient system, which may be first computing system 101, according to anembodiment of the present invention. In an embodiment, the fileacquisition services may comprise a program or function that monitorsthe receipt of document files received by the client system 101 from oneor more sources. These documents files may be received in multipleformats including, but not limited to, e-mails, instant messages, HL-7files, scanned documents, text documents, audio files, transcriptionfiles, image files, ASTM message files, mark-up language files, and thelike. In an embodiment, all document files may be stored in a specificfolder or folders and the file acquisition services (505) monitors thespecific folder or folders.

In an embodiment, the client system 101 may also include referencedatabase acquisition services (510). In one embodiment, referencedatabase acquisition services obtains from the client system 101 areference database that may be used to index or match document files torecords in the reference database. For example, a reference database inthe physician's office 010 may comprise a database of records forpatients. Consider the exemplary reference database 100A depicted inFIG. 4B. Reference database 100A includes a plurality of records 410-1to 410-n containing one or more data fields 405A-D. In an embodiment,reference database 100A may include one or more fields 405E-x forincluding additional identifying indicia, additional data, links tofiles, notes, instructions for processing document files, and otherdata. As noted above, the fields of reference database 100A may bepopulated using one or more methods for including or entering data intoa database. For example, assuming the database is used by a medicalcenter and the entries represent patients of the medical center, theentries may be entered by a receptionist, imported from other databases,and/or obtained from previously indexed/processed files.

In one embodiment, during an initial setup, the entire referencedatabase may be transmitted to the indexing service provider 201 for usefor indexing and/or processing files according to embodiments of thepresent invention. In an embodiment of the invention, changes to theclient system's database may be monitored by the reference databaseacquisition services so that only the differential changes need be sentto the indexing service provider 201. Alternatively, the entirereference database may be transmitted to the indexing service providerat periodic intervals or at the occurrence of certain events. In anotheralternative embodiment, the reference database 100 may be accessible bythe indexing service provider.

In an embodiment, the client system 101 may login to access the indexingservice provider system 201. In one embodiment, when a client logs (515)into the indexing service provider system 201, the client account may bevalidated to determine if the account is valid (525). If the account isvalid, a notification (545) may be sent to the indexing recipient 101,and it may proceed with transferring of any files and reference databaseor reference database updates as part of the transfer services (555). Ifthe account is not valid, the indexing service provider 201 may submit anotification (530) to the client system 101 that the account is notactive. In an embodiment, the client system 101 may receive (535) anotification to activate the account and the process may end (540). Inan embodiment, the notification may indicate what steps may need to betaken to activate the account, including without limitation, paying pastdue bills, subscribing to services, or updating other information, fees,or software.

Embodiments of Indexing System Overview

FIG. 6 depicts an exemplary method for providing indexing services andadditional processing services to a client according to an embodiment ofthe present invention. Illustrated in FIG. 6 is an indexing recipient,or client, system 101 and an indexing service provider system 201. In anembodiment, the method for providing indexing and data processingservices may include file(s) and reference database transfer services(605) in which received document files and a reference database may betransferred to the indexing service provider, as mentioned in the priorsection. In an embodiment, the indexing service provider 201 may receivethe document file or files and reference database or databases throughits transfer and unpacking services (610). In an embodiment, thedocument file(s) and/or reference database(s) may be encrypted and/ormay also be compressed. Accordingly, indexing service provider 201 mayemploy extraction services (615) to decrypt and decompress the data, ifnecessary.

The files received from the client system 101 may be processed by theindexing services (620) of the indexing service provider, which may alsoinclude the processing of document files that do not yield matches bymanual indexing.

In an embodiment, observation services may also be performed (625)related to the document files. In an embodiment, observation servicesmay include, but are not limited to, noting the occurrence of certainkey characters or strings within a document file. For example, in amedical report certain terminology found to occur within a document filemay trigger specified actions. In an embodiment, a specified action maybe indicating to the client system 101, a recipient, or a third partythat a certain terminology has been found. For example, the presence ofcertain terms, numbers, phrases, etc. being found in a document file maybe used to alert a client. In an embodiment, additional data may beconditionally associated with data associated with the document file.For example, identification within the document file of testing positivefor some marker may be associated with a selected action or actions,such as, indicating that a follow-up appointment should be scheduled. Inan embodiment, first computing system 101 or indexing service provider201 may interface with one or more programs to initiate an action. Forexample, first or second computing systems 101, 201 may interface with acalendaring program to suggest or schedule appointments and mayinterface with a messaging program to notify a patient.

In an embodiment, indexing service provider 201 may comprise messagingservices (630) in which notifications and transmissions of data may besent to the client system 101, a recipient, and/or third parties. Asexplained in more detail below, the messaging services may create andtransmit a structured message, a message with additional data that maybe associated with a matched document file or structured message, and/ora composite message that combines items into a message.

In embodiments, the indexing service provider 201 may additionallyprovide archiving and retrieval services (635) for the indexingrecipient 101. For example, the indexing service provider 201 mayprovide data back-up functionality for document files, referencedatabases, and other files, which files may be accessed by the indexingrecipient 101.

In an embodiment, indexing service provider 201 may include packagingand transmission services (640) for transmitting data to the indexingrecipient 101. In embodiments, the packaging and transmission servicesmay include encryption and compression features or algorithms. Inembodiments, the packaging and transmission services may be part of themessaging services; or alternatively, the messaging services may be partof the packaging and transmission services.

In an embodiment, one or more steps or event occurrences may be linked(650) to a billing event and noted in billing records or in a billingtable for billing to an indexing recipient or third party.

One skilled in the art shall recognize that the above-described areembodiments and that other configurations, including with fewer oradditional steps or services, fall within the scope of the presentinventions. Aspects of the steps mentioned above shall be described inmore detail below.

Embodiments of Transfer Services

FIG. 7 depicts an embodiment of transfer services performed in aclient-server embodiment. As illustrated in the embodiment depicted inFIG. 7, an indexing recipient (or client) system 101 creates (705) abatch number and renames each file that is to be transmitted to anindexing service provider 201. In one embodiment, the client system 101may generate a unique batch number by using a client account number plusa sequential number and/or a date/time number. In an embodiment, clientsystem 101 may loop through each file to be processed to ensure that ithas exclusive system access to the file. Client system 101 may not haveexclusive access to a file if, for example, the file is still beingreceived by client system 101 or is being used by another application onthe client system. In an embodiment, the files may be renamed with aclient account number or code, batch number, and a unique file name, andmove/copy each renamed file into a “transit” folder. One skilled in theart will recognize that the renaming and moving/copying of the files tothe transit folder may occur as part of the same step.

In an embodiment, the client system 101 may create an empty compressionfile with a file name comprising the batch number and a client accountnumber or code. Each renamed file in the transit folder may be moved tothe compression file. In one embodiment, the compression file may be a“Zip” file format. The compressed file may also be encrypted. In oneembodiment, the encrypted file may be identified by adding an extension,such as “.enc” to the file name used for the compressed file.

In the depicted embodiment, the client system 101 announces (710) thebatch to the indexing service provider (server) 201, and may alsotransmit a number that represents the number of files that are in thebatch, the name of the batch file, and a client account and/orsub-account identification. If the batch information is received intotal by the server, a batch ID may be generated (715) and transmitted(720) to the client system 101. In an embodiment, the batch ID may be asequential number representing the total number of batches received todate by the service provider. In an embodiment, the batch number may berelated to the batch ID. For example, it may contain a time-date stampand may be generated during the same transaction of transmitting filesto the server.

As illustrated in FIG. 7, the batch ID is received (725) by the clientsystem 101. If the batch ID is zero (0), an error has occurred. In anembodiment, any error information may be logged and the transmitprocedure may restart at the beginning or at any intermediate step tothe point of re-announcing the batch.

If the batch ID is not zero, then the announcement was successful. Thatis, the client system 101 has successfully informed the server system201 that a batch is about to be transmitted. In an embodiment, theclient system 101 may loop through each file in the transit file andannounce (735) the file name and batch ID to the server system 201. Theannouncement of the file registers a filename and batch ID to lateridentify the file on the server. In an embodiment, a batch detail recordmay be created (740) on the server system 201. The batch detail recordmay be used to define a document file on the server side 201. In anembodiment, the batch detail record may be used to eventually containall details about a document file. The batch record may then be updated(745) with the number of files.

For the server system to begin indexing, it must be able to determinewhen files are ready. In an embodiment, the server system may employ afile watcher service or monitor service to monitor or look for files. Toprevent the watcher service from inadvertently finding files that arenot yet completely transferred, the service system 201 may also look fora request file, or REQ file. In an embodiment, an REQ file is created(750), which file may be a blank file with the same file name as theencrypted batch package file name with an additional extension, such as“.req.”

In the depicted embodiment, the client system 101 transfers (755) thebatch package, which in this illustrated embodiment is a compressed andencrypted file containing the document files, and its associated REQfile. By transmitting the batch package first followed by the REQ, whenthe file watcher service finds the REQ file, the server system isassured that the batch package file has already been received.

In an embodiment, the server system 210 may notify (765) the clientsystem 101 that it has received the files. In one embodiment, if eitherfile is not received, the client system 101 may repeat all or part ofthe entire transfer. This may include renaming and moving the imagefiles to their original locations. In an embodiment, if the batchpackage and REQ files were successfully received by the server system201, the files in the transit folder may be moved to a “pending” folder,and the client system 101 may be deleted batch package and REQ filesfrom its system.

In an embodiment, after unpacking the batch package, the server system201 may check the number of files that were announced to it. If thenumber of document files in the batch do not equal the number of filesthat were announced to the server system, an alert notification may bemade by the server system and sent to an individual, a systemadministrator, and/or to the client system. In an embodiment, anautomated process may be initiated to rollback the erroneoustransmission and reinitiate the transfer.

Embodiments of Unpack Services

Turning to FIG. 8, an exemplary method for unpacking files from theindexing recipient 101 according to an embodiment of the presentinvention is depicted. FIG. 8 may represent an embodiment of the unpackservices (610) mentioned in FIG. 6. As depicted in the embodiment ofFIG. 8, the indexing service provider 201 may monitor (805) an inputdirectory for receipt of files from an indexing recipient or clientsystem 101. In an embodiment, when files have been received or found(810) to be present in an input directory, the indexing service provider201 may look up (812) the batch number that has been received.

As mentioned previously, embodiments of the present invention mayinclude encrypting files to provide security. Embodiments of the presentinvention may also include utilizing compression algorithms to helpreduce bandwidth requirements of transmitting data between the indexingclient system 101 and the indexing service provider 201. The embodimentdepicted in FIG. 8 is directed toward embodiments in which compressionand encryption have been performed as part of the transmission process.Alternative embodiments may not include encrypting, compression, orboth.

Returning now to FIG. 8, if the batch package is properly decrypted(815), the batch package may be extracted or uncompressed. If thedecryption or extraction is not successful (820), the received batchpackage and its associated REQ file may be moved (850) to an errordirectory for additional processing. In an embodiment, the additionalprocessing may include requesting the indexing recipient system 101 toretransmit the files or to change encryption or compression algorithms.

In an embodiment, following successful decryption and extraction, theindexing service provider system 201 may set (825) the batch status to“active” and for each document file in the batch package, performadditional processing. In an embodiment, this additional processing mayinclude marking (830) a document file in a database as being received,storing (835) each document file in a database, creating (840) an REQfile for the document file, and moving or otherwise noting that thedocument file is ready for further processing. In an embodiment, thenoting that the document file is ready for further processing may beaccomplished by moving (845) the document file or copying the documentfile and the new REQ file to an extraction directory. In an embodiment,a monitoring service may begin the extraction processes for a documentfile when its REQ file is present.

Embodiments of Extraction Services

FIG. 9 depicts an embodiment of a method for extracting characters froma document file according to an embodiment of the present invention. Insome instances, a document file may directly representative of the datacontained in a physical or electronic media. For example, a documentfile that is an HL-7 file directly represents the data containedtherein. In some embodiments, a document file may indirectly representthe data contained in a physical or electronic media. For example, adocument file of a scanned image indirectly represents the datacontained within the scanned document. Data extraction may be beneficialin such cases to extract at least some of the plurality of charactersthat is related to the data of interest. For example, optical characterrecognition or voice character recognition operations may assist inextracting the data. In either event, the document file comprises datathat comprises a plurality of characters.

In an embodiment, indexing service provider system 201 monitors (905) anextraction directory for receipt of a document file and its associatedREQ file. When those files are received, a document file may have dataextracted (910) from the document file.

In an embodiment, the extraction type performed by the indexing serviceprovider system 201 may be determined by one or more characteristicssuch as, for example, file type or extension, client or account, or maybe indicated in the REQ file. For example, an image file that is aportable document format (PDF), or some image file type such as a TIFF,GIF, JPEG, or the like, may be sent for optical character recognition.If the document file is an image file, the data contained within thedocument that the document file represents may be converted from theimage file. In one embodiment, optical character recognition operationsmay be performed to convert the document file to obtain at least some ofthe plurality of characters, which characters may include alphanumerictext or graphics. In an embodiment, the optical character recognitionmay be performed on machine-generated documents and/or on handwrittendocuments.

Assume, by way of example, that the report 400 in FIG. 4A is scanned tocreate a document file that is an image file of the report 400. Byperforming optical character recognition operations on the documentfile, at least some of the plurality of characters representinginformation on report 400 may be obtained. This data may include thealphanumeric text on report 400, for example, the patient's name, age,date of birth, account number, test results, and the like. This data maybe used for indexing or processing of the document file.

Audio files, which may be denoted by having an audio extension such as,for example, .wav or .mp3, or the like, may be processed using voicerecognition methods. In an embodiment, an audio file may be converted byusing speech recognition software or hardware.

In an embodiment, extraction services may also be used for documentsthat are already in an electronic format that is character-based byextracting or parsing characters from structured fields. One skilled inthe art will also recognize that certain file types may possess one ormore fields which makes identifying strings and indexing files easierand more accurate. Consider, by way of illustration, an HL-7 data fileor message. An HL-7 message is a structured ASCII file with delimitingcharacters, or pipes, that divide the file into segments or fields,which correspond to or can be used as identifying indicia. For example,the first line of data in an HL-7 message is typically the messageheader segment which identifies the file producer and date the file wascreated. The file may also identify additional information including,but not limited to, to whom the message refers, internal accountnumbers, external account numbers, various patient information, and theprovider of services.

In one embodiment, the file type is RTF, TXT, or other similartext-based file containing a plurality of characters that may be usedfor indexing or processing the file. Consider, by way of illustration, atranscription file or message containing the transcript of an audiofile. One skilled in the art will also recognize that text-based filetypes are inherently less prone to matching error based on individualmatch strings and thus may provide a high degree of resolution andcomputation.

Second and/or first computing system 201/101 may be configured to indexa structured document file based upon one or more of the identifyingindicia strings contained within known fields in the file. In anembodiment, a set of one or more strings from the document file may becompared against a comparison reference database in the same or similarmanner as described below with reference to indexing services forvalidation and/or error correction. Because these document files maycontain errors, by comparing these files against the reference database,these errors may be identified and corrected, thereby improving theaccuracy of the indexing process. For example, a provider of laboratoryservices that manually enters data by reading a specimen label mayinherently produce erroneous structured message document files. Thisstructured message document file may be reconciled against a referencedatabase and corrected, thereby improving the accuracy of a previousmanual process.

One skilled in the art will also recognize that other forms of dataconversion may be performed on a document file wherein at least some ofthe plurality of characters may be obtained, regardless of the type ofdata originally received.

In an embodiment, when data has been extracted from a document file,indexing service provider system 201 may check (915) if the process hasbeen successful. In one embodiment, if the process has been successful,the characters may be stored (935) in a file and that file and an REQfile may be moved (940) to the input of a matching/indexing utility.

In an embodiment, if the extraction process has not been successful, thedocument file may be subjected to a rotation utility (920) for rotatingthe image. An exemplary rotation utility is described below withreference to FIG. 10. A rotation utility may or may not be performeddepending on the file type. For example, if the document file is anaudio file, TXT, RTF, XML, or HL-7 file, rotation would not beperformed. If the rotation algorithm is successful (925), then theextracted character data may be stored (935) in a data file andassociated with that document file from which it was extracted. In anembodiment, if the rotation utility is not successful or if no rotationutility is performed, then no characters may be stored (930) in thedatabase data file associated with that document file.

FIG. 10 depicts an exemplary method for extracting character data from adocument file according to an embodiment of the present invention. Inthe depicted embodiment, the image data may be converted (1010), forexample, through the use of an optical character recognition algorithmor algorithms, if necessary. The resulting character data obtained fromthe optical character recognition process may be used to identify allstring candidates of length m or greater, where m may be preset or userselected. In one embodiment, m may be three or more characters; that is,each string composed of three or more characters is identified. Thesestrings may then be compared (1020) against a reference dictionary ordictionaries. In an embodiment, a reference dictionary may be adictionary of common words, or may be words specific to a client,account, or sub-account. For example, if the client is a medicalprofession, the reference dictionary may have words that commonly occurwithin that client's practice. In an embodiment, the referencedictionary may contain words specific to an industry and common wordsnot specific to any industry.

The comparison of the string candidates with the reference dictionarydetermines if any words are found (1025) from the character dataobtained from the extraction process. If no words are found, the dataobtained from the extraction process is likely to be nonsensical and itis also likely that an error or problem occurred during the extractionprocess. An example of an error may be that the document file containedan image that when scanned or otherwise produced was in a layout that isdifferent than the layout assumed by the extraction process. Forexample, the image may be in landscape view or somewhat skewed and theextraction process assumes a portrait layout. According to an embodimentof the present invention, the image may be rotated some n degrees (1030)and have the steps repeated again to see if the alignment is such thatcharacter data that yields words has been extracted. This process may berepeated a set number of times, until words are found, a user-selectednumber of times, or until all orientations have been checked.

In an embodiment, it may be set such that if the process has repeatedsteps (1010) through (1030) a number of times and no words are found,the process may end and return an alert that the process failed—that nodata was found and store a blank character data file as mentioned inFIG. 9 (step 930). If words are found, the character data may be added(1035) to the character data file.

In an embodiment, additional orientations may be checked (1040). Forexample, in some reports, the textual data may exist in differentorientations. For example, some characters may be in landscape layoutand some characters may be in portrait layout. In the embodimentdepicted in FIG. 10, additional orientations may be checked (1040) tocapture that character data. If it is desired that additionalorientations are checked, the image may be rotated a certain number ofdegrees, n, which may be preset or user selected, and the processrepeated. If checking additional orientations (1040) is not desired, thecharacter data obtained from the process may proceed (1045) to the nextstage. As noted previously, if no character data was found, thecharacter data file would be blank.

Turning to FIG. 11, in an embodiment, the character data file obtainedfrom the extraction services may be checked against a referencedictionary to determine if valid data was extracted. FIG. 11 depicts anexemplary method for determining if valid data was obtained from theextraction services according to an embodiment of the invention. Similarto what was depicted with reference to FIG. 10, the character data maybe checked (1110) against one or more dictionaries. In embodiments, thereference directory may be specific to a client, may be a generaldictionary, or may be some combination thereof. By checking stringsagainst a reference dictionary, it may be determined (1115) whethervalid words occur within the extracted character data file. In anembodiment, if no valid words are found, the file may be marked as“error” in a database of the indexing service provider 201. In oneembodiment, a blank character data file may indicate that an error hasoccurred.

In an embodiment, if valid data is found, the process may proceed togenerating (1120) an array of strings from character data file, whichcomprises a plurality of characters.

Exemplary Character Data File and Exemplary Array of Strings

FIG. 12A depicts an exemplary character data file 1200 comprising aplurality of characters that might be obtained from extraction servicesperformed on the document file 400. In an embodiment, the plurality ofcharacters may be organized into an array of strings 1205 or 1210 asdepicted in FIG. 12B. In one embodiment, a string may be defined as aset of characters bounded by delimiters, such as space, tabs,punctuation, and the like. In the depicted embodiment in FIG. 12B, thestrings are selected by space delimiters, and a string (e.g., 1220-1)may be assigned a position within the array (e.g., 1215-1).

Embodiments of Indexing Services

It should be noted, however, that difficulties may arise in processing adocument file if the character data associated with it contain errors.For example, one or more of the character data, whether through dataentry error or misidentification of a character or word by recognitionoperations, may be incorrect. Accordingly, in an embodiment, acomparison reference database may be employed to improve the accuracy ofidentifying, indexing, and/or processing of a document file.

In embodiments of the present invention, the array of strings obtainedfrom a document file may be compared against a comparison referencedatabase to help index and/or process the document file. The comparisonreference database may be the full reference database obtained from theindexing recipient system 101, or alternatively, the comparisonreference database may be the database resulting from one or morefiltering operations performed upon the full reference database or on analready filtered reference database. It shall be noted that in someinstances even after performing filtering, the comparison referencedatabase may be equivalent to the reference database. Some embodimentsof the present invention may utilize filters on the array of stringsobtained from a document file, on the reference database, or both inattempts to reduce either or both files. Reducing either or both thearray of strings and the reference database speeds the indexing. Itshall be noted that the terms “filter” and “filtering” may be construedto mean one or more filtering/matching operations.

As noted previously, the information contained in or converted from adocument file includes a plurality of character elements. Thesecharacter data elements may be used as identifying indicia forcategorizing the document file. In an embodiment, the character data maymatch information in a comparison reference database with varying levelsof accuracy. The data string elements are generally arranged inproximity between respective pairs of data string elements that compriseidentifying indicia. As such, the data may define identifying indicia tovarying degrees of accuracy.

In order to improve the accuracy of the identifying indicia, secondcomputing system 201 may analyze the data elements associated with thedocument file, in particular by utilizing approximate matchingalgorithms and comparing a reference database to data string elements ata plurality of points along the length of the data element.

Absent comparison with one or more known reference databases, the valuesof the data string elements derived from the document files may haveerrors since the document files may contain erroneous information fromthe primary data source, such as from missing, incorrect, or misspelledinformation, or from the extraction process, such as optical characterrecognition, speech recognition, or optical mark recognition.

In embodiments, second computing system 201 may interpret a value fordata string elements contained within document file derived fromphysical or electronic media. In one embodiment, one or more comparisonreference databases may be applied to a data string element to obtain avalue for that data string element. The value for a data string elementmay be the result of applying a comparison reference database to theoriginal data string element. By repeating this process at a pluralityof points consisting of data string elements, the identifying indiciacontained within the document file may be extracted such that aresulting array of strings, a structured file comprising data from thedocument file, a composite, or a message representing the data containedwithin the document file is precise relative to the reference database.In the present embodiment, the resultant data file, which may be anarray of strings or set of strings, may be utilized in automatedindexing processes.

In an embodiment, in order to improve at least some of the plurality ofdata elements associated with the document file, second computing system201 may be configured to automatically correct information associatedwith the document file according to a reference database or databases.In an embodiment, second computing system 201 may apply a Levenshteinalgorithm to correct the information associated with the document file.In one embodiment, second computing system 201 may apply aLevenshtein-distance algorithm, which is known to those skilled in theart and is disclosed in Algorithms and Theory of Computation Handbook,CRC Press LLC, 1999, “Levenshtein distance”, in Dictionary of Algorithmsand Data Structures, Paul E. Black, ed., U.S. National Institute ofStandards and Technology (10 Nov. 2005), and which is also available at<http://www.nist.gov/dads/HTML/Levenshtein.html>, the contents of eachare incorporated herein by reference. One skilled in the art willrecognize that a variety of approximate matching and correctiontechniques may be utilized to correct information, such as the pluralityof data elements associated with a document file, and such techniquesare within the scope of the present invention.

In addition to the foregoing or as an alternative, as part of theextraction process and/or as part of the indexing/matching process(es),one or more techniques may be employed, including associative memorytechniques that rely on learned coupling constraints or objective setdefinition procedures, such as, for example, bigrams. Other approachesto error-tolerant searching, which include but are not limited to,deterministic finite automation, hash tables, associative memory,bipartite matching, longest-common-subsequence (LCS), glob stylematching, regular expressions matching, and other approaches known tothose skilled in the art may be also employed. Searching methods arefurther described by Gonzalo Navarro and Mathieu Raffinot in FlexiblePattern Matching in Strings (Cambridge University Press, 2002); byMaxime Crochemore and Wojciech Rytter in Jewels of Stringology (WorldScientific, 2002); and by Vladimir I. Levenshtein in Binary codescapable of correcting deletions, insertions, and reversals, DokladyAkademii Nauk SSSR, 163(4):845-848, 1965 (Russian) (English translationin Soviet Physics Doklady, 10(8):707-710, 1966), the contents of each ofthe above is incorporated herein by reference.

One or more matching algorithms may be employed as part of or incombination with an indexing/processing method; exemplaryindexing/processing methods are provided below for purposes ofillustration.

FIG. 13 depicts an exemplary method 1300 for indexing a document fileaccording to an embodiment of the present invention. In an embodiment, amatching algorithm and/or one or more filters may be selected (1310).The matching algorithm, filters, or both may be preset or may be userselected. One skilled in the art shall recognize that a matchingalgorithm may be a filter and a filter may be a matching algorithm. Forexample, filtering the reference database based on a characteristic orcharacteristics may filter the reference database to a single matchingrecord. Alternatively, a matching algorithm may return two or morerecords that satisfying the matching criteria, thus effectivelyfiltering the reference database, and this filtered reference databasemay be used in subsequent filtering and/or subsequent matchingalgorithms.

The filtering (if applicable) and matching algorithm is performed(1315), and the results obtained. If a sufficient threshold match hasbeen found (1325), the document file may indexed. In an embodiment, thethreshold match value may be preset or user selected and may be basedupon one or more factors including, but not limited to, the number ofmatching strings in the array of strings, the uniqueness of the matchingstrings, the degree of fuzziness allowed in the extraction and/ormatching processes, the type of filters and/or matching algorithms used,the degree of matching with the next closest match or matches, and thelike. In an embodiment, the indexing service provider system 201 mayindex a document file by associating the document file with a matchingrecord by generating (1330) a structured message that links the documentfile to the matching record. In embodiments, the structured message maybe an HL-7 message, a mark-up language file, a file in a database, atext file with associated information, some other file type, or acombination thereof.

If a threshold match has not been achieved, another match algorithmand/or filtering operation may be selected (1335) and the processrepeated. In an embodiment, the process may be repeated until a matchhas been determined or until all the filters and/or algorithms have beenutilized.

If a threshold match still has not been found, the document file may besent or loaded into a manual indexer (1340). The manual indexingservices will be described in more detail below, but in an embodiment,the manual indexer may present the document file to an individual formanual matching. In an embodiment, one or more of the highest rankingmatches (if any) may be associated with the document file and loadedinto the manual indexer to provide matching suggestions to the user. Inan embodiment, if a match is made via the manual indexer, the documentmay be associated with a record via a structured message (1330), asdiscussed previously.

In an embodiment, if, after manual review, an indexing match has notbeen made, the document file may be marked for deletion (1350) and/or itmay be put into a queue for reprocessing. Reprocessing may be beneficialin certain instances. Consider, for example, if the comparison databasedoes not yet contain a record to which the document file should beindexed. By waiting and reprocessing, the reference database may beupdated and a match found.

FIG. 14 represent an alternative embodiment of a method for indexing adocument file. The method depicted in FIG. 14 is the same as thatdisclosed with respect to FIG. 13 with the exception of an additionalstep (1410). In an embodiment, the indexing services may attempt todetermine the document type that the document file represents. FIG. 15depicts an embodiment of a method for determining the document type of adocument file.

FIG. 15 depicts an exemplary method for determining a document type of adocument file according to an embodiment of the present invention. In anembodiment, the array of strings for a document file may be compared(1510) against a phrase list or lists of document types. The phrase listmay be specific to a client or industry or may be general. For example,a specific phrase list for medical office may include a list of medicallab reports and the like. If a phrase match is found (1515) the documenttype may be associated with the document file. In an embodiment, thedocument type may be associated with the document file by storing (1520)the document type in a structured file for the document file.

If a phrase match is not found, the document type may be recorded (1530)that it is not known. In an embodiment, the document type may store(1530) the document type in a structured file as “Unsigned ExternalOther,” which means that it is not currently known. In an embodiment, ifthe document type is not known, a user may be alerted and requested(1635) to review the document file and input the document type, if any,and update the document type list. By updating the document type phraselist, more document types may be identified in subsequent document fileprocessing. In an embodiment, the alert and review to determine documenttype may be performed via the manual indexer utility.

In one embodiment, an array of strings or set of strings may beassociated with document types. The frequency of words, key words, orkey word phrases may be calculated and tabulated. The association ofword frequencies, key words, or key word phrases with the document typemay be stored in a relational database. Subsequent string arrays fromunknown document types may then be compared to previously storedassociations and an estimation of document type may be obtained. In oneembodiment, when a threshold of certainty for document match is reached,then the unknown document may be assigned a document type.

In one embodiment, system 201 may learn by experience to suggest themost likely document type match, and this suggestion may be associatedwith document file submitted to a manual indexer. Based on a user'sresponse, a match association is made. That match association may bestored for use in other automated document type matches.

In an embodiment, the array of strings for a document file may beanalyzed for word frequency and/or word associations and comparedagainst known word frequencies, key words, or key word phrases containedin or associated with a phrase list or list of document types. Thephrase list or list of document types may be specific to a client orindustry or may be general. For example, a phrase list or list ofdocument types for medical office may include word frequency, key words,key word phrases, word/phrase associates, word/phrase proximity, and thelike to help identify document types, such radiology reports, pathologyreports, medical lab reports, and the like. For example, a phrase listor list of document types may indicate that multiple instances of thekey word “X-ray” or a few instance of the key word “X-ray” in connectionwith at least on instance of “Radiology” in an array of strings mayresult in a conclusion that a threshold match (1515) has been reached.If a threshold match is found (1515), the document type may beassociated with the document file.

In an embodiment, an examination of the array of strings using inputfrom the phrase list may result in some matches but none that exceed athreshold match. One or more of the document type matches may beprovided to a user as suggestions. In an embodiment, the phrase list maybe updated by identifying new document types associations. In anembodiment, the alert and review to determine document type and documenttype associations may be performed via the manual indexer utility. In anembodiment, the system may record the matching configurations for futureassociations and matching, or utilize other adaptive learning techniquesknown to those skilled in the art to improve the matching processes.

One skilled in the art shall recognize that adaptive learning by thesystem helps increase indexing and processing and may be applied toother aspects of the system, including but not limited to embodiments ofmatching/filtering not limited to document type. One skilled in the artshall also recognize that the phrase lists or dictionaries utilized aspart of the matching/filtering may comprise not only key words and/orkey phrases querying, but also utilize word frequencies, wordproximities, conditional relationships, word associations, and the likeand may be utilized in other matching/filtering applications describedherein or known to those skilled in the art. It shall also be noted thata “word,” such as in “key word,” is a string.

Embodiment of the present invention may utilize one or more match/filteroperations on the array or strings and/or on the comparison referencedatabase to aid in the indexing. Consider the following exemplarymethods for indexing a document file.

Let A be the input alphabet, a finite set of symbols. Elements of A arecalled the characters, which may be text or symbols. Examples ofalphabets may include, but are not limited to, the set of all ordinaryletters, the set of binary digits, and the set of 256 8-bit ASCIIsymbols. In an embodiment, words or strings over A are finite sequencesof elements of A. The length (size) of a string may be the number of itselements, which may include repetitions. Thus, the length of “aba” is 3.The length of a string may be denoted by IA The input data for anembodiment of a matching function may be a string, which may be thearray of strings from a document file or a portion thereof.

The i-th element of string h is denoted by h[i] and i is its position onh. We denote by h[i . . . j] the factor h[i], h[i+1], . . . , h[j] of h.If i is greater than j, by convention, the string s[i . . . j] is anempty string (a sequence of length 0), which may be denoted by ε. In anembodiment, the string h of length m may be referred to as a factor(also called a substring or subword) of the string y if h=y[i₁]y[i₂] . .. y[i_(m)], where i₁, i₂, . . . i_(m) is an increasing sequence ofindices on y.

Instead of just one pattern, one can consider a finite set of patternsand ask whether a given string contains a pattern from each set.Information related to string matching has been discussed by MaximeCrochemore and Wojciech Rytter in Jewels of Stringology (WorldScientific, 2002) at pp 10-11, which is incorporated herein by referencein its entirety.

Assume for purpose of explanation, that an array of strings comprisesstrings h₁ . . . h_(n) of the same or varying lengths |x|, and alsoassume that an array of strings that contain at least one capitalizedcharacter, CAPSTRING, comprises strings H₁ . . . H_(n). In anembodiment, the CAPSTRING strings, H₁ . . . H_(n), may be a subset ofthe array of strings h₁ . . . h_(n).

An embodiment of a matching function may comprise the following steps.In an embodiment, a filtering operation may be performed, which maycomprise apply one or more filters, to reduce the size of the referencedatabase and/or of the array of strings. For example, an array ofstrings obtained from a document file may be filtered to obtain allstrings H_(n) of length |x| that contain a capital letter. In anembodiment, after identifying all strings H_(n), strings surroundingthese strings may also be included in the filtered result. That is,embodiment of the present invention may use identified strings as anchorpoints for including or excluding additional strings in the set ofstrings used for matching. In an embodiment, the inclusion or exclusionof strings may be symmetrically or asymmetrically disposed about theanchor points. In an embodiment, the filtered result may select stringswithin a selected location, p, of the an identified string Hn, such thatthe filtered set of strings comprises the strings H_(n−p) . . . , H_(n),. . . H_(n+p). Assume, for the purposes of illustration, that p=1, thenthe set of strings would be H_(n−1), H_(n), and H_(n+1). In anembodiment, the filtered set of strings may contain a plurality of setof strings comprising strings within the same or different proximitiesof identified strings.

In an embodiment, a sequence list comprising sequences of length m thatcorresponds to first m characters in each string from a set of stringsmay be generated. If m=3 and if the set of strings comprises the stringswith at least one capital letter, Hn, then the sequence list wouldcomprise the sequence (H_(n)[1], H_(n)[2], H_(n)[3]) for each string Hnin the set of strings. In an embodiment, a sequence may be generatedfrom a substring portion of the string, and in an embodiment, thesequence list may comprise one or more sequences from strings in the setof strings. It should be noted that these sequence lists may be used formatching/filtering purposes. One skilled in the art shall recognize thatone benefit of using sequence lists, or substrings, is that if thereexists some errors, such as from entry errors or as a result of theextraction process, matches may still be obtained by matching substringportions.

Consider now a comparison reference database, which may be a fullreference database, a subset of a full reference database, or one ormore subsets of a comparison reference database. Let the comparisonreference database be composed of rows |α|, where α₁, α₂, . . . , α_(n)represent the set of possible comparison reference database rows in thecomparison reference database. In an embodiment, each row may correspondto a record, wherein each record comprises one or more data fieldelements. Examples of data field elements may include, but are notlimited to, the fields 405 depicted in FIG. 4B (i.e., name, date ofbirth, account number, service provider, provider, etc.). In anembodiment, a data field element may comprise a set of elements.

In an embodiment, a set of strings, which may comprise a list ofsequences, may be compared to the comparison reference database toreduce the α (row) candidates by matching the sequences against α₁, α₂,. . . , α_(n). In an embodiment, search functions or algorithms may beemployed, such as, for example, using the search engine marketed bydtSearch, Corp. of Bethesda, Md. In an embodiment, the row candidates(a) may be ranked by number of matches per row.

If only one row candidate is returned (has a match or matches), then thedocument file may be associated with that record. Alternatively, ifadditional verification is desired, additional matching may beperformed, include without limitation, checking some or all of the arrayof strings against the row or rows to determine if more matches arefound.

In an embodiment, if more than one row candidate has a match or matches,each such row candidate may be searched against the entire array ofstrings, or a subset thereof, to identify matches. In an embodiment, thematches may be grouped by row (α_(n)) to derive a new function orpattern, denoted INDXMATCH. In an embodiment, INDXMATCH for a row α_(n)may be denoted INDXMATCH_α_(n) and equals the set of matches, MATCH₁,MATCH₂, . . . , MATCHφ occurring in row α_(n). The number of matchesfound in row α_(n) is φ. In an embodiment, the INDXMATCH results may beranked by φ, which ranking may be used to indexing the document file. Inan embodiment, certain values of matches in a row, MATCHφ, may be givendifferent weights for ranking purposes.

It shall be noted that each INDXMATCH_α_(n) forms a pattern that may besearched against the reference database, or subset portion thereof. Letthe number of instances that the pattern INDXMATCH_α_(n) occurs in thereference database equal ρ. In an embodiment, the document file with anINDXMATCH_α_(n) that yields a value of ρ=1 may be defined as a thresholdmatch. In an embodiment, if INDXMATCH_α_(n) occurs in the referencedatabase such that the value of ρ>1, then those reference database rowscontaining the INDXMATCH_α_(n) pattern may undergo additionalfiltering/matching operations or may be submitted to a manual indexer.In an embodiment, the frequency of an INDXMATCH_α_(n) pattern may bedefined as ρ/Σα_(j), where j is the number of rows in the referencedatabase in which the pattern is searched. The probability of the match,P_(m), may be defined as 1−(ρ/Σα_(j)). In an embodiment, theprobability, P_(m), may be associated with the document file, such as ina structured message file. In an embodiment, the probability that arandomly selected identifying indicia unrelated to the INDXMATCH_α_(n)would coincidentally share the observed pattern profile is the productof the individual match frequencies.

One skilled in the art will recognize that additional filtering/matchingoperations may be performed with the above described embodiments. Forexample, as discussed above matching/filtering the array of stringsbased upon capital letters, using strings within a proximity ofidentified strings, using sequences lists, using INDXMATCH patternmatching, and the like may be employed in combinations. Additionalexamples of filtering/matching operations include, but are not limited,to filtering by string size, filtering by dictionary/phrase list orlists, filtering by recently matched records, etc. One skilled in theart shall also recognize that steps performed above may be rearranged,excluded, or repeated. For example, in an embodiment, one or more anchorpoints may be selected strings in the array of strings that have matchedsomething in the reference database. It should be noted that one benefitof using anchor points is to improve the searching/matching byintroducing proximity weighting.

Consider, by way of illustration, the following example. An array ofstrings may be filtered to obtain strings that may correspond to a birthdate. This set of strings may be searched against a comparison referencedatabase. If a string or a plurality of strings matches data fieldelements in the comparison reference database, one or more of thosestrings may be used as anchor points to form a set of strings. Inembodiments, other identifying indicia, such as name, account number,social security number, etc., are likely to be in proximity in the arrayof strings to the date of birth. In an embodiment, the set of stringsobtained from proximity weighting may be used with INDXMATCH patternmatching or other filtering/matching algorithms.

FIG. 16 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention. In anembodiment, the array of strings obtained from the document file may befiltered (1610) to obtain all strings that included at least onecapitalized letter. In an embodiment, additional filtering may be partof the filtering operation. As depicted in FIG. 16, the set of stringsattain from the capital list filter may be filtered to remove (1615)common words, and may be filtered to select (1620) only strings that aregreater than y characters in length.

In an embodiment, one or more sequence lists may be created. In thedepicted embodiment, two sequence lists was may be populated, m₁ and m₂.The first sequence list, m₁, may be defined as a substring of length rstarting at a first character position for each string in the set ofstrings obtained after the filtering operation, and the second sequencelist, m₂, may be defined as a substring of length s that starts at asecond character position. In an embodiment, the first and secondcharacter positions may be the same and the character lengths r and smay be the same. For purposes of illustration, assume that r=s=3 andthat ml starts at character position 1 and m₂ starts a characterposition 2. The sequence lists for the string “test” would be m₁=tes andm₂=est. Returning to FIG. 16, in an embodiment, the reference databasemay be filtered to generate a comparison reference database of justfirst name and last name data fields. Matching may be performed betweenthe set of strings comprising the sequence lists, m1 and m2, and thecomparison reference database. In an embodiment, one or more Booleanoperators may be used in the searching procedure. For example, Booleansearching may comprise searching (1630) for first and last name matchingboth m₁ and m₂; first or last name matching both m₁ and m₂; first andlast name matching either m₁ or m₂; first or last name matching eitherm₁ or m₂; or any combination thereof. The results obtained from thissearch may be considered a comparison reference database comprising alist of potential matching candidates, and one skilled in the art willrecognize this as a filtering operation. In an embodiment, for eachcandidate data field, all possible substrings may be calculated (1635),and starting with the longest fragment, the array of strings, or afiltered subset thereof, may be searched to find the longest fragmentthat matches. In an embodiment, one or more of the matching stringswithin the array of strings may become an anchor point for theirmatching candidates. In an embodiment, the comparison reference databasecomprising the candidate list may be filtered (1645) to those rows orrecords where fragments of both the first and last name were found inthe array of strings or subset thereof. In an embodiment, the comparisonreference database obtained from step 1645 may be filtered (1650) basedupon the proximity of the string fragments to each other. For example,in an embodiment, a filter may select only those candidates from thecomparison reference database wherein the first name fragment match andthe last name fragment match are within a set number of positions withinthe array.

In an embodiment, each candidate within the comparison referencedatabase obtained from step 1650 may be compared against the array ofstrings or a portion thereof (such as a set of strings obtained from oneor more of the filtering steps 1610-1620) to look (1655) for othermatching strings of identifying indicia. In an embodiment, a match valueor score may be assigned (1660) to each string from a record foundwithin the array of strings or portion thereof. In embodiments, thematch value may be the same value per match (e.g., each match regardlessof what is matched receives the same value) or may be different values(e.g., longer string matches or matches to certain data fields may havehigher point values). In an embodiment, one point may be assigned (1660)to each string or substring from a record found within the array ofstrings or portion thereof. In an embodiment, if a single record has thehighest match score and that score exceeds (1665) a threshold matchvalue z, that record may be selected (1670) as the matching record andthe document file may be associated with that record. If more than onerecord has yielded the highest match score or if the highest scoringrecord does not have a match score that exceeds a threshold match valuez, then in an embodiment, the candidates with the highest score(s) maybe listed in a manual indexer. In an embodiment, these candidates may beranked according to their match scores and displayed with the ranks orin ranking order. In an embodiment, the matching string or stringfragments for each of these candidates may also be displayed as part ofthe manual indexing process. One skilled in the art shall recognize thatembodiments the methods presented above may end if, following afiltering/matching step, one candidate is returned.

One skilled in the art shall recognize the assignment of match valuesmay be applied to any matching task or operation, including withoutlimitation, document type, service provider, service recipient,recording events, observations, or other indexing tasks not specificallylisted.

Consider the following exemplary embodiments of methods for matching adocument file with a record or records. For purpose of illustration,assume that the document file is an image that has undergone anextraction process to yield the following array of strings:

TABLE 1 SAMPLE ARRAY OF STRINGS Acme Women's Medical Associates, IncBoard Certified Specialists in Women's Fiealth Care John J. Doe, MD,PhD, FACOG Michael D. Gelring, MD, FACOG Jane Smith, RN, CNM 111 N.Crestwood PO Box 2222 Porterville, CA 93258 559 555 5555 Fax: 559 5556666 May 11, 2006 Page 1 Patient Information For: Dreda J SchmidlkobblerDOB: 0 911 511 94 0 Account #: 6463 Patient Consent for Use andDisclosure o Health Information I Dreda J Schmidlkobbler hereby give myconsent for Acme Womens edical Associates, Inc to use and discloseprotected health information about me to carry out treatment, p yment,and health care operations.

In an embodiment, a filtering operation may be performed upon the arrayof strings to obtain a filtered set of strings. In an embodiment, thefiltering operation may comprise one or more filters. An example of afilter may be a client/indexing recipient address filter that searchesfor and removes, if present, the address of the indexing recipient. Forexample, if the client were Acme Women's Medical Association with anaddress of 111 N. Crestwood, PO Box 222, Porterville, Calif. 93258, thefilter may look for these strings. In an embodiment, variants theclient's address and contact information may also be included.

Another example of a filter may be a size filter that removes allstrings that do not exceed a set number of characters in length y. Forexample, if y=4, all strings with three or fewer characters may befiltered out of the set of strings, such as, for example, Inc, in, MD,PhD, DO, RN, CNM, for, Use, and, o, #:, I, J, my, and so forth.

Another example of a filter may be an exclusion list filter comprised ofstrings to be excluded, which may include general words and/or clientspecific words. For example, client employee names, such as John J. Doeand Jane Smith may be excluded from the array of strings.

Yet another example of a filter may be a dictionary filter comprised ofstrings to be excluded, which may include general words and/or clientspecific words. Examples of words that may be excluded from the abovearray of strings may include such word as Board, Certified, Specialists,Women's, Patient, Information, hereby, give, consent, disclose,protected, health, information, about and the like.

Another example of a filter may be a duplication filter, in whichduplicate strings may be removed.

In an embodiment, after the filtering operation, the resulting set ofstrings filtered from the array of strings may be that listed in Table2.

TABLE 2 SET OF STRINGS Fiealth 2006 6463 Michael Gelring FACOG DredaSchmidlkobbler edical yment

In an embodiment, one or more sequence lists for each of the stringsfrom the set of strings that contain a capital letter may be generated.For illustration purposes, assume each string with a capital letter(e.g., Michael, Gelring, Dreda, and Schmidlkobbler) has two sequencescreated, m₁ and m₂, where m₁=the first three characters of the stringand m₂=the three character of the string starting at the secondcharacter in the string. Thus, the resulting sequences would be:

m₁=FIE, MIC, GEL, FAC, DRE, and SCH

m₂=IEA, ICH, ELR, ACO, RED, and CHM

In an embodiment, relational pairs may be generated based upon proximityto each other in the set of strings. Table 3 shows relational pairs forthe illustrated example:

TABLE 3 RELATIONAL PAIRS m₁ M₂ r1 FIE, MIC IEA, ICH r2 MIC, GEL ICH, ELRr3 GEL, FAC ELR, ACO r4 FAC, DRE ACO, RED r5 DRE, SCH RED, CHM

In an embodiment, the set of strings in Table 3 may be compared againsta comparison reference database trying to find records in the comparisonreference database where the first name and last name data fieldelements match both m₁, r_(x) and m₂, r_(x). For purposes ofillustration, assume the records from the comparison reference databasethat satisfy the above-stated conditions are:

TABLE 4 QUERY RESULTS PID DOB EXT ID SSN FIRST NAME M. NAME LAST NAME108130 Dec. 27, 1968 2162 ABC-11-9999 DREDRAM K SCHMIDT 285050 Sep. 15,1940 6463 DEF-00-8888 DREDA J SCHMIDLKOBBLER

In an embodiment, the comparison reference database in Table 4 may befurther reduced by taking the FIRST NAME and/or LAST NAME data fileelements for each of the candidate records and creating a stringfragment table. For example, the substring fragment list for DREDRAM maycomprise: DREDRAM, DREDRA, REDRAM, EDRAM, EDRA, DRAM, DRE, RAM, and EDR;and the substring fragment list for DREDA may comprise: DREDA, DRED,REDA, DRE, RED, and EDA. It shall be noted that the size of thesubstring may be varied.

In an embodiment, starting with the longest fragment, the set ofstrings, which represents a filtered portion of the array of strings,may be searched to find the longest fragment present in the set ofstrings that matches this fragment. In an embodiment, a matched stringwithin the set of strings may become an anchor point for this recordcandidate, and a search may be performed for the longest FIRST NAMEand/or LAST NAME substring within p string positions of the anchorpoint. In one embodiment, p may equal 2.

In an embodiment, if no match exists, this anchor point may be ignoredand a search may be performed to find a new anchor point, wherein theprocess of searching the strings surrounding the anchor point isrepeated.

In an embodiment, if a match for a substring exists for both FIRST NAMEand LAST NAME, then a match score of 2 points may be assigned to thatrecord.

In an embodiment, an INDXMATCH pattern comprising the matching sequencesMATCH₁, MATCH₂, . . . , and MATCHφ_(n) for a record may be generated,where a substring match is MATCHφ_(n). In the illustrated example,INDXMATCH₂ is Dreda Schmidlkobbler or Schmidlkobbler, Dreda andINDXMATCH₁ is Dredram, Schmidt.

In an embodiment, let the number of instances (i.e., frequency) ofINDXMATCH_(n) in the comparison reference database equal ρ_(n). If avalues or values of ρ_(n)=1, then the records with the INDXMATCHpatterns that produced that frequency may be associated or matched withthe document file.

In an embodiment, if the records' INDXMATCH patterns generate frequencyvalues ρ_(n)>1, then it may be considered inconclusive whether such arecord matches. In an embodiment, some or all of these records may forma comparison reference database and additional criteria or operationsmay be used to reduce the number of record candidates. In an embodiment,a document file may be associated with more than one record.

In an embodiment, the proximity of search strings surrounding anchorpoints may be increased or iteratively increased. For example, searchesmay be performed for the longest FIRST NAME and/or LAST NAME substringwithin 15 string positions of an anchor point. If no match exists, thecandidate records from the comparison database may be sent to a manualindexer as suggestion from which a user may select.

In an embodiment, if additional match sequences are identified, anadditional point may be assigned to a record for each such additionalmatch sequence, wherein the points may be used to match a record to adocument file and/or to rank the records. In one embodiment, let thenumber of match sequences that comprises INDXMATCH be φ, where φ=1, 2,3, . . . , or z. The candidate record with the highest φ value may bematched with the document file.

Turning to FIG. 17, an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention isdepicted. In the embodiment depicted in FIG. 17, the reference databasemay be filtered using dates obtained from the array of strings. Thearray of strings may be searched to identify (1705) all strings or setsof strings that may conform to a date format, and these may be sorted(1710) chronologically. The earliest date may be assumed (1715) to bethe date of birth of a patient, and that date may be compared againstthe date of birth fields to identify (1725) all candidate records thathave the same date of birth. In embodiments, if the date field for arecord is empty, that record may be included or excluded as a candidaterecord. The resulting candidate records form a comparison referencedatabase. In an embodiment, if a single candidate record is returned,the document file may be associated with that record.

As depicted in FIG. 17, the string in the array of strings that isassumed to be the date of birth may form an anchor point. Strings withinx places from the anchor point may be searched (1730) against thecomparison reference database. If a threshold match is found (1735),that record may be associated (1740) with the document file. As notedpreviously, a document file may be associated with a record by storinginformation to a structured message.

If a threshold match is not found (1735), the proximity filter may beexpanded (1750). If the proximity filter is expanded (1755), the newlyadded strings may be compared against the comparison reference database.This process may be repeated until a match is found, a set number oftimes, until all the strings and the array of strings have beenincluded, and/or until a user indicates to stop.

If, after the above steps, a threshold match has not been exceeded, itmay be recorded (1760) that no match was found. In an embodiment, thecandidate records may be submitted to a manual indexer.

Turning to FIG. 18, an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention isdepicted. In the embodiment depicted in FIG. 18, a record data fieldelement or elements, such as a patient identifier, may be used to filtera document file. One or more record data elements, such as patient name,account number, social security number, date of birth, etc. may be usedto search the array of strings of a document file, or a set of stringsobtained from the array of strings, to locate (1820) a matchingmarker/identifying indicia. If a marker is found (1825), the marker maybe used as an anchor point. In an embodiment, a set number of stringsmay be selected surrounding the anchor point. In an alternativeembodiment, a set number of characters surrounding the marker may beselected (1830), and those characters may be placed into a set ofstrings (1835).

In an embodiment, the array of strings or the set of strings may besearched to obtain (1840) the oldest date, which may be assumed to be abirth date. The comparison reference database may be queried to obtain(1850) a listing of all records in which a person has a matching birthdate, which may form a new comparison reference database. One or moredata fields from this comparison reference database, such as first andlast name (1855), maybe checked against the set of strings. If a matchis found (1860), the document file may be associated with the matchingrecord. In an embodiment, the document file may be associated with thematching record by storing (1865) information in a structured message.If more than one match was found or if no matches were found, one ormore additional matching/filtering operations may be performed. In oneembodiment, an matching algorithm or method, such is the one describedwith reference to FIG. 16, may be employed (1870) and the resultsreturned to generate a set of strings (1835) wherein the method may berepeated.

In an embodiment, if an initial marker is not located within the arrayof strings, the entire array of strings may be selected (1875) and theprocess may continue from step 1840 in like manner as described above.

FIG. 19 depicts an exemplary method for determining a date of service ofa document file according to an embodiment of the present invention. Anembodiment of the date of service utility may begin by searching (1910)the array of strings, or a filtered version thereof, to identifyspecific data. In an embodiment, a dictionary list may be used to searchfor specific words. For example, a list of document types may becompared against the strings.

If identified data is found, a date of service may be found (1915) basedon a specific algorithm related to that identified data. Consider, forexample, the exemplary embodiment depicted in FIG. 20. The identifieddata may help indicate where the information may be located within thedocument file. For example, if the phrase “pathology lab report” isfound within the array of strings, it may be known that the date ofservice will be within a set distance (2010) from that phrase.Accordingly, the data service may be easily identified. In such cases,the date of service information may be associated (1920/2030) with thedocument file. In an alternative embodiment, the date of servicealgorithm may look for a date relative to the dates within the report.Consider for example the following example—assume that the report typeis known and it is known that that report type contains three datefields: a birth date of a patient, a date service, and the date thereport was submitted to a client. The date-of-service algorithm may beidentified by finding the three dates within the set of strings andlocating the middle date since it will be after the birth date butbefore the date the report was submitted to the indexing recipientsystem.

In one embodiment, the date of service information may be stored in astructured message for the document file. One skilled in the art shallrecognize that other algorithms may be used to determine informationonce another piece of identifying data has been found.

Returning to FIG. 19, if no data has been identified within the array ofstrings that is beneficial for identifying the date of service, thearray of strings may be searched (1930) to identify all stringscorresponding to a date format. The selected dates may be sorted (1935)chronologically, and a check (1940) made to see if the most recent dateis the current date. If the most recent date is the current date, it maybe that the date found is referencing the date the document file wassubmitted. Thus, in an embodiment, if a penultimate date is present(1945), that date may be set (1950) as the date of service andassociated (1920) with the document file as discussed previously.

If the most recent date is not the current date (1940), then a check maybe performed (1955) to determine whether that date is greater a set timeinterval old. In an embodiment, it may be assumed that a document filehas been received because of some recent activity; therefore, if arecent date appears within the array of strings and that date isrelatively recent, then that date may be set (1965) as the data serviceand associated (1920) with the document file, as discussed previously.

If the most recent date is not the current date (1940) and the mostrecent date is greater than a set amount of time old, the date ofservice may be set (1960) as “Unknown” and that information may beassociated (1920) with the document file. In an embodiment, if no datestrings were located within the array of strings, the date of servicemay similarly be set as “Unknown.” In one embodiment, date candidatesmay be sent to the manual indexer as match information comprising datesuggestions.

Turning to FIG. 21, an embodiment of a method for indexing a documentfile is depicted. The method begins by generating (2105) a filtered setof the array of strings by selecting every string that has at least onecapital letter, CAPSTRING. In an embodiment, this set of strings mayoptionally be further reduced (2110). In one embodiment, additionalfiltering may be performed to the set of strings by removing (2115) anystrings from the set of strings that match strings in a list of strings,such as a dictionary list, client address/contact information list, orthe like. One skilled and the art will recognize that other filteringsteps may be performed as part of this initial filtering operation.

The set of strings obtained from the filtering operation may be used tofind pattern matches in the reference database, or in certain fieldswithin the reference database, such as, for example, first name, lastname, and the like. In an embodiment, substrings from the set of stringsmay be used to find matches within the reference database. For example,substrings n characters in length may be used. The records that resultsin a match from the comparison (2120) may be considered a comparisonreference database.

In an embodiment, if the pattern match process returns no record (i.e.,the comparison reference database is the empty set), the filteringoperation used to obtain the comparison reference database may beexpanded (2130). If it is desired to change the filtering, one or morefiltering parameters may be changed (2135). For example, the size of thesubstrings, n, may be decreased to obtain smaller substrings sizes, andthe process may be repeated of comparing the substrings to the referencedatabase to obtain a comparison reference database. If expanding thefilter is not desired (2130), it may be indicated (2165) that no recordmatch was found for the document file. In an embodiment, the documentfile may be sent to a manual indexer for manual indexing of the documentfile.

If the comparison reference database is not the empty set, the array ofstrings, or a filtered array of strings such as the set of strings fromstep 2105, may be compared (2140) against the comparison referencedatabase to identify additional matches. The records within thecomparison reference database that yielded matches may be ranked (2145)according to ranking criteria. In an embodiment of ranking criteria maybe based on the number of matches within the record and may includeweighting the ranks based upon which fields within the record werematched. If a record exceeds (2150) a threshold matched level, thedocument file may be associated (2160) with the matching record. In anembodiment, the file may be associated with the record by storinginformation to a structured message file, which may include theinformation that was matched.

If no record exceeds a threshold match, the records with at least onematch, or alternatively, only the top ranked records, may be sent (2165)to a manual indexer for manual indexing by a user. There may also be anindication (2165) that no record match was found for the document file.In an embodiment, the indication that no record match was found may bestored in a structured message for the document file.

FIG. 22 depicts an alternative embodiment of a method for indexing adocument file according to an embodiment of the present invention. Inthe embodiment depicted in FIG. 22, the array of strings may initiallybe filtered to extract (2210) strings conforming to a date format indetermining (2215) the oldest date.

Assuming the oldest date corresponds to a birth date, that date may becompared against the date of birth field in a reference database. Thecomparison reference database obtained from this operation may containone or more records. To provide additional assurance that a record isthe correct match or to further reduce the comparison referencedatabase, one or more matching/filtering operations 2225-1-2225-n may beperformed. In an embodiment, the matching/filtering operations may betiered.

For purposes of illustration, consider the following tiered searchembodiment. The search may begin by selecting the first name and lastname from the date-of-birth filtered comparison reference database tolook for those strings within 3 strings of each other (proximity value)in the array of strings. In an embodiment, the date of birth string maybe used as an anchor point for reducing the array of strings. In anembodiment, the degree of match, herein referred to as fuzziness or thethreshold match value, may be set to a specific value. In an embodiment,the fuzziness value may be set at a value that requires a close match.

A second tier matching/filtering operation may comprise the followingmatching/filtering process. If the comparison reference databasecomprises candidate records with matching date of birth but no matcheswere found during the first name and last name search, then in anembodiment, the threshold match value may be adjusted to allow for lessexact matching and/or the proximity value may be increased.

A third tier matching/filtering operation may comprise the followingmatching/filtering process. Additional fields from records within thecomparison reference database may be utilized. In an embodiment, accountnumber, patient ID, social security number, and the like may be used inthe matching/filtering. In an embodiment, the fuzziness/threshold matchvalue may be set to require a close match.

A fourth tier matching/filtering operation may comprise searching forfirst name and/or last name within a proximate range of one or more ofthe foregoing identifiers, i.e., account number, patient ID, socialsecurity number, and the like.

An embodiment of a last tier matching/filtering operation may comprisethe following. First, a capital list string filter may be applied toreduce the array of strings to a set of strings that comprise at leastone capital letter in each string. The reference database may befiltered by identifying all candidate records that have the first threeletters of the first name and the last name and the second three lettersof the first name and the last name. In an embodiment, the comparisonreference database may be reduced further by excluding all records thathave not had any activity with a set number of dates, for example, 45days.

If no record has a match that exceeds a threshold value, a search may beperformed to identify all candidate records that have the first threeletters of the first name and the last name or the second three lettersof the first name and the last name. In an embodiment, the comparisonreference database may be reduced further by excluding all records thathave not had any activity with a set number of dates, for example, 45days.

If a record is found to exceed a threshold match, the document file maybe associated (2230) with that record, and the system may wait (2235)for the next document file or array of strings from a document file tobe received for processing.

If, following the matching/filtering operations, the document file hasnot been successfully matched to a record, the final comparisonreference database obtained from the matching/filtering operations maybe examined (2240) to determine the number of records contained therein.If more than one record is a matching candidate, this information may besent (2240) to a manual indexer for manual indexing by a user. If norecords exist within the comparison reference database, it may beindicated (2245) that no record match was found. In an embodiment, thedocument file may be sent (2240) to a manual indexer for manualindexing. Alternatively, the document file may be put into a queue andmay be reprocessed at a later date or following a specified event, suchas for example, receiving an update to the reference database.

One skilled in the art shall recognize that filters/matching algorithmsmay be used in any orders, in any combination for any matching ortiering. In an embodiment, the application of a filtering operation oroperations may be directed by processing times and/or match results.Filters may be applied to an unmatched array of strings or to acomparison reference database (which shall be construed to also includethe reference database or a previously filtered comparison referencedatabase). Examples of filters have been given herein and some areadditionally given below, although one skilled in the art shall realizethat other filters/matching algorithms not listed here may also be used.

Date of Service (DOS) Filter. The comparison reference database may bereduced by applying a DOS filter so that only candidates with activity(e.g. have been seen by a doctor) within or after a certain time periodare used for matching algorithm(s).

Date of Indexing (DOI) Filter. The comparison reference database may bereduced by applying a DOI filter so that only candidates with activity(e.g. have been recently indexed) within or after a certain time periodare used for matching algorithm(s).

INDXMATCH Filter. The comparison reference database may be reduced byapplying a filter so that only candidates derived from the referencedatabase that meet pattern matching criteria are used for matchingalgorithm(s). In an embodiment, the pattern match filter may be derivedfrom the array of strings by identifying string candidates of n length,considered as the longest common substring.

Boolean Filter. The comparison reference database may be reduced byapplying a Boolean filter so that only candidates derived from the arrayof strings that meet Boolean criteria (AND/OR) are used for matchingalgorithm(s). In embodiment, the complexity of the search criteria maybe varied to include proximity searching, root expansion, wild cardsearching, conditional operators, string frequencies, stringassociations, match profiles, and the like, as well as Booleanoperators.

CAPS Filter. The comparison reference database may be reduced byapplying a set of strings that have been derived from the array ofstrings and wherein the strings in the set of strings have at least oncapital letter. By applying such a filter, only reference databaserecords that meet capital letter pattern matching criteria are used formatching algorithm(s).

Subtraction Filter. The comparison reference database or array ofstrings/set of strings may be reduced by applying a subtraction filterderived from the array of strings or from other source(s). An example ofa subtraction filter may be removing common words from the array ofstrings. Another illustrative example may be attempting to process anarray of strings from a document file that has multiple patient names.Once a patient name is identified, the identifiers for that patient(which may come from the matching record for that patient) may besubtracted from the array of strings and the array of strings may bereprocessed to look for other patients.

Fuzziness Filter. As noted previously, the threshold level of matchidentity may be varied. In an embodiment, a fuzziness of 1 may be anexact match, where a fuzziness of 10 may be a weak match. Adjusting thefuzziness can allow one to identify sequence candidates while allowingfor the causes of mismatch, such as OCR error, misspellings, etc.

It shall be noted that filtering/matching algorithms may be adjustedbased on match quality. One skilled in the art shall recognize that anumber of matching/filtering operations may be performed as part of theembodiment depicted in FIG. 22, including without limitation all thosedescribed herein. It shall also be noted that the embodiment depicted inFIG. 22 is for purpose of illustration and that embodiments may beemployed.

FIG. 23 depicts an exemplary method for determining a providerassociated with a document file according to an embodiment of thepresent invention. The array of strings obtained from a document filemay be searched to identify a provider. A provider may mean a recipientof the document file, an author of the document file, a patient, asubject of a document file, the owner of the document file, the user ofa document file, and the like. In an embodiment, because the accountinformation for the document file is known; that is, the indexingrecipient information or account is known, a list of possible providersfor this account may be accessed (2315). That list may be comparedagainst the array of strings to identify (2320) providers.

In an embodiment, a provider may be determined based upon an associationrather than from finding a direct match in the array of strings. In oneembodiment, the list of providers may comprise more than just a listingof providers, but may also include associations with providers. Forexample, the list of providers may include key words or matching that,when found, results in an association with a provider. In an embodiment,the provider may be associated with a document file based upon thedocument file being matched to a record in a reference database. Forexample, the provider may be associated with a record in a referencedatabase and this information may be associated with the document filewhen the document file is matched to the record. In an embodiment, aprovider may be associated with a document file based upon informationprovided within a record in the reference database to which the documentfile has been matched.

If no providers or more than one provider is identified within the arrayof strings, a default provider for that account may be assigned (2330).If one provider is found, that provider may be assigned or associated(2325) with that document file. In an embodiment, the providerinformation may be associated with a document file by storing theprovider data into a structured message for that document file. In anembodiment, the client or indexing recipient or the provider identifiedmay be billed. For example, if the document file is lab results and aprovider that performed the lab testing has been identified, and thepatient for which this testing has been performed has also been matchedwithin the database, one embodiment of the present invention may involvebilling the patient for the services provided by the laboratory. In anembodiment, the indexing recipient may be billed for services providedby the indexing service provider.

Turning to FIG. 24, an exemplary method for indexing a document fileaccording to an embodiment of the present invention is illustrated. Inan embodiment, unmatched document file may be compared (2410) againstthe match results of the previously document in the batch. In anembodiment, a comparison reference database may comprise the recordswhich have been successfully matched to other document files within abatch. An array of strings for a non-indexed/unmatched document file maybe compared (2420) against this comparison reference database. In anembodiment, the comparison reference database may also include recordsthat were manually indexed. The array of strings may also be compared(2425) against the results of other matched or manually index documentsfrom the same or recent batches. In an embodiment, the unmatcheddocument file may be compared (2430) against a comparison referencedatabase using one are more subtraction library techniques.

If any of the foregoing comparison methods successfully identifymatching information, this matching information may be associated (2415)with the document file. If the foregoing matching techniques were unableto identify a matching record, the document file may be indicated (2435)as having no match and may be sent to a manual indexer for indexing by auser.

Exemplary Embodiments of Additional Data

In an embodiment, additional data may be related to or associated with adocument file. In an embodiment, this additional data may includeadditional text, such as one or more standard or predefined paragraphs.In an embodiment, the additional data may include, but is not limitedto, predefined text, predefined video, web sites information,photographs, pictures or other images, letterhead, stationery, links toany of these items, pointer to the document file's location, a link tothe document file, or the like. In an embodiment, the additional datamay include the information contained within a reference database ordatabases. The additional data may also include, but is not limited to,corrected identifying indicia such as name, date of birth, socialsecurity number or the like. The additional data may also include, butis not limited to, structured data, array of strings/set of strings,document identifying indicia such as document type, event observations,document content, interpretation of document content, and the like.

As a result of matching, interpolation, and/or approximation processes,second computing device 201 may effectively define or identify one ormore additional data elements. In one embodiment, once a match between adocument file and a reference database record has been made, additionaldata may be added to or associated with the document file. In anembodiment, one or more of the fields 405 may provide additionalinformation that may be associated with the document file. For example,the additional data may include an account number or other information.In an embodiment, corrected data may be additional data and may be addedto the associated data, the document file, structured data, and/orreferenced database.

By way of illustrative example, an account number may be additionallyidentified based upon associated data elements such as name, date ofbirth, or social security number. In an embodiment, if additional datais present in the reference database record associated with the documentfile but not in the document file, that data may be added to thestructured message.

In yet another embodiment, the additional data may be data to includewith the document file. For example, in an exemplary case, additionaldata such as, for example, notes from the physician, prior medicalinformation, test results, or other data may be included with thedocument file.

In an embodiment, the additional data may include internal or externalinstructions for processing the document file. According to one aspectof the present invention, a user, client, or third party may providefirst or second computing device 101/201 with instructions related to orassociated with a document file, record, or account. These instructionsmay include additional data to be included with the document file. In anembodiment, the instructions may indicate that a message is to begenerated and may also indicate the additional data that is to beprovided in the message or messages to recipients and/or in certaintypes of messages. For example, the instructions may indicate that allmessages to a particular indexing recipient should include a predefinedletterhead or background image and should further include additionaltext that may have been previously stored. For example, Ms. Alamb mayhave set specific instructions that she wants a copy of all reports tobe sent to her. The additional data may include instructions to firstand/or second computing system 101/201 to transmit a copy of thedocument file 400 to her and may include an address, fax number, oremail address for Ms. Alamb.

The first and/or second computing system 101/201 may be adapted tocreate a variety of different types of messages, including, but notlimited to email messages, facsimiles, instant messages, and audiomessages. In an embodiment, the type of message generated may dependupon either the instructions received by the first and/or secondcomputing system 101/201 from a user or upon prior parameters that havebeen defined with respect to messages directed to the intendedrecipient.

Exemplary Embodiments of Packaging and Transmission Services

FIG. 25 depicts an exemplary method for returning information related toprocessed document files to a client system according to an embodimentof the present invention. In an embodiment, the method of FIG. 25 may beperformed by the packaging and transmission services of indexing serviceprovider 201. As depicted in FIG. 25, the indexing service providersystem 201 may obtain (2505) a list of the current active batches, andcount (2510) the number of complete document files and error documentfiles. A check may be performed (2515) to verify that the batch hascompleted processing. That is, that the number of complete files pluserror files equal the total number of files that batch contained. If thetotal number of files does not equal to the total number of files inthat batch, the system 201 may wait for the batch to finish processing.

If the batch is completed, a package or folder for all files that areready for packaging for this batch may be generated (2520) and all filesnot ready for packaging may be marked as incomplete. The files which maybe ready for packaging may include, for example, a structured messagefile for each of the process document files. The structured messagefiles, which may be an XML, HL-7, text, or other file type, may be moved(2525) into the package file. The return status for the package and/orthe files within the package may be indicated (2530) as “packaged.” Inan embodiment, a bill for the client/indexing recipient may be generated(2535) and may be included with the package or sent separately. In anembodiment, a rename file may be generated that instructs the clientsystem 101 how to rename the document file to pair/index it with thestructured messages. In this way, the document files need not beretransmitted to the client system 101. In an embodiment, the structuredmessage may also be the rename file. In an embodiment, the package filemay be compressed and/or encrypted (2545) as part of the transmission.In an embodiment, the package file may be placed (2550) on a server,such as a file transfer protocol server, for transmission to the clientsystem 101, wherein the client may initiate the transmission. In analternative embodiment, the package may be transmitted to the clientsystem 101.

FIG. 26 depicts exemplary types of information that may be associatedwith a document file according to an embodiment of the presentinvention. As illustrated in FIG. 26, a plurality of types ofinformation may be associated with a document file, including but notlimited to, document type information 2605, demographic data 2610,additional information 2615, array of strings and/or one more sets ofstrings 2620, provider 2635, matched results 2625, and other matchinginformation found through the process of matching or filtering.Additional information may mean the same as discussed previously,including, without limitation, information contained within one or moredata fields of a matching record. In an embodiment, reference database100A may also include one or more additional fields 405E-x for includingadditional indicia, additional data, links to files, notes, instructionsfor processing received files, and other data. Throughout the process offiltering or matching, a structured message may be populated with thisinformation. This structure message may be stored in a directory (2640)by the indexing service provider 201 and returned to the client system101 as part of the package. In an embodiment, the structured message mayalso include information about instructing a client on how to index thedocument file.

Exemplary Embodiments of Composite Messaging Services

FIG. 27 illustrates an exemplary composite message according to anembodiment of the present invention. In embodiments, it may bebeneficial to create composites, such as, for example, when transmittingmessages. A composite may comprise the combination of any additionaldata with one or more of the following: other additional data, adocument file, the array of strings (or portion thereof), a referencedatabase record, file location, image file, thumbnail, hyperlink,graphics, audio files, video files, and the like. One skilled in the artwill recognize other items may be included in a composite.

In embodiments, first or second computing device 101/201 may create acomposite, such as a composite image, message, record, or file,including both the document file and the additional composite items. Inone embodiment, a composite message may be created that includes theimage of the information contained within a document file and additionaldata included within the body of the same message. In embodiments, thedocument file may be superimposed upon the additional data, such as ininstances in which the additional data is letterhead, stationery or someother background image. In these embodiments, first or second computingsystem can overlay the information contained within the document fileupon the additional data in such a manner that in those locations atwhich the information contained within the document file properlyoverlaps the additional data. In an embodiment, the additional data maybe treated as being transparent such that the information containedwithin the document file will appear to be overlaid upon the additionaldata. Composite messages are beneficial because, depending upon theembodiment, the intended recipient can receive a message that includesboth the document file and any additional data that is related to orotherwise associated with the document file.

Consider, by way of illustration, the following example. Havingidentified that report 400 is a lab report for Mary Alamb by use of oneor more of the methods discussed above, additional data may includeinstructions indicating that a composite message should be sent to Ms.Alamb. In one embodiment, Mary may have indicated that she desires toreceive copies of all reports. In an alternative embodiment, one or morekey words or phrases from the document file may indicate that a messageshould be generated and sent. For example, the indication in a “Notes”field that the results of the lab testing yielded a certain result, suchas testing “positive,” may trigger a message being sent to Mary. In anembodiment, additional data may be conditionally associated with dataassociated with the document file. For example, identification withinthe document file of testing a positive for gram-negative bacteria maybe associated with a selected text, such as, indicating that a follow-upappointment should be scheduled. In an embodiment, first or secondcomputing system 101/201 may interface with one or more programs, suchas a calendaring system to suggest or schedule appointments, or toinitiate an action.

Alternatively or additionally, first or second computing device maycreate a composite message that includes an image of the received data.In an embodiment, the received data to be incorporated into a messagemay be embedded as an image, such as a portable document format (.pdf),tagged image file format (.tif), or the like, into the hypertext mark-uplanguage (html) of the email message or contained within an HL-7message. For most current email clients, such as Lotus Notes or Outlookusers, the image of the data will appear in the body of the emailmessage itself. However, some devices may utilize older or differentemail clients, such as older versions of Lotus Notes, for example, thatwill place the image of the data in an attachment to the email message.In some embodiments, the email client will determine whether the imagewill appear in the body of the email message or as an attachment. Inalternative embodiments, where the first or second computing system101/201 has information about the characteristics of the email clientregarding images, the system may decide whether to send the message withthe image appearing in the body of the message or as an attachment. Inan embodiment, while the first or second computing device may transmitthe email message directly to a computer or other computing devicehaving an email client of the intended recipient, the first or secondcomputing system may transmit the email message to an email server (notshown) for subsequent delivery to the intended recipient. In any event,the recipient can receive an email message and view the data. It shouldbe noted that data, such as maps, diagrams, drawings, reports,documents, and various language characters, may also be readilytransmitted.

Alternatively or additionally, the first or second computing system101/201 may create a message that includes a file location reference orlink to the document file. Consider, by way of illustration, the message2700 depicted in FIG. 27. Depicted in FIG. 27 is an email message whichmay be generated by first or second computing system 101/201. Includedwithin email message 2700 is a link 2705 to the report 400. In anembodiment, security and encryption may be employed to restrict accessto the linked file 400.

One skilled in the art will recognize that other forms of communicationmay likewise be employed. In an embodiment, an instant messagecontaining the received data or a link to the data may be transmittedfrom the first or second computing system to one or more devices ornetworks having instant messaging capability.

In yet another embodiment, the document file may be included in the bodyof a facsimile. In this regard, a facsimile coversheet, generallyidentifying the intended recipient as well as the phone and facsimilenumbers of the intended recipient and name and phone number of the usertransmitting the facsimile, may be defined, either by the user at thetime of transmitting the information or at some prior time. In eitherinstance, a user may define a custom facsimile coversheet tailored tothe user or an intended recipient.

In an embodiment, first or second computing system 101/201 may store oneor more of the following: the document file, the array of strings (orportions thereof), the additional data, a composite, or a message. Inone embodiment, first or second computing system may place the indexedinformation, or a link thereto, in a predefined location for import intoan electronic record or other database software application. A user ofthe electronic record or other database software application may accessand view the document file, the additional data, the composite, and/orthe message while using the application. In an alternative embodiment,first or second computing device may transmit the indexed data, or alink thereto, to a second device, for storing in a predefined locationfor import into an electronic record or other database softwareapplication.

Exemplary Embodiments of Manual Indexing

FIG. 28 depicts an exemplary method for presenting files for manualreview or indexing according to an embodiment of the present invention.In an embodiment, the manual indexer may be part of a database interfacesystem at the indexing recipient system 101 or the indexing serviceprovider system 201. Incomplete files or files that have been marked as“no match found” may be sent (2805) to a manual indexing utility orservice. In an embodiment, the manual indexer may also load (2810) anddisplay suggested matches. A user may review (2815) the document fileand indicate to which record the document file should be matched. In anembodiment, the manual indexer may additionally include (2820) featuressuch as a search features to search the array of strings for thedocument file and/or a reference database to obtain additional values orreplace suggested match values. Following the manual review, thedocument file may be indexed (2825). In an embodiment, the indexinformation may be processed in like manner as other index documentfiles including being sent to the packaging services, an embodiment ofwhich is depicted in FIG. 25.

In an embodiment, a manual indexer user interface may comprise a viewingsection or sections for displaying match information. In an embodiment,the manual indexer user interface may comprise a viewing section foroptionally viewing items such as, a document file, its associated arrayof strings or set of strings, the document file's associated structuredmessage with the data that has been obtain through matching operations,and log information, which might contain system or processinginformation and additional information collected through theindexing/matching process. The manual indexer user interface maycomprise a section to display and allow a user to review matched datafields for a document file and unmatched data fields, including anypreloaded suggestions for the unmatched data fields obtained through thematching operations. In an embodiment, the user may review and approveor correct the matched data fields. Matching information, includingpossible matching candidates, rankings, structured data file, stringmatches, and any other of the data available for viewing as discussedabove, may be displayed to the user. The user may provide otherinformation that has not been identified in the document file. Forexample, the user may select and enter the document type or providerinformation. This information may be added to items such as phraseslists and the like and may be associated with matching profiles therebyallowing the system to adaptively improve for subsequent matchingoperations. The manual indexer user interface may also compriseadditional features and inputs that may be specific to an indexingclient or to a database system.

In an embodiment, the manual indexer may utilize user-derivedassociations and feedback to modify the indexing processes in anadaptive method by providing document indicia suggestions and receivinguser-responsive feedback to modify the matching/filtering elements,including but not limited to threshold match values, dictionary/phraselists, match associations, and the like. In an embodiment, the manualindexer may provide the ability to add information to dictionary/phraselists, such as, exclusion list, document type lists, provider lists,client contact lists, and the like. In an embodiment, the manual indexermay associate information, such as document type or provider, to a wordfrequency value, a key word, or key phrase thereby enabling the indexerto suggest potential matches or values, and/or to improve subsequentmatching operations.

Exemplary Embodiments of File Indexing and Processing Services

FIG. 29 depicts an exemplary method for receiving information related toprocessed document files from an indexing service provider according toan embodiment of the present invention. In an embodiment, indexingrecipient system 101 receives (2905) an encrypted package file anddecrypts the package (2910) from the indexing service provider 201. Inan embodiment, indexing recipient system 101 decompresses (2915) therename files and structured message files and moves them to a pendingfolder. In an embodiment, the rename files indicate (2920) whichdocument files in the pending folder are to be moved and to where theyshould be moved. In an embodiment, the indexing recipient system mayverify (2925) that the document file is still in its pending folder. Ifthe document file is no longer in its pending folder, the indexingrecipient system may notify (2930) the indexing service provider thatthe document file no longer exists, and the document file may berestored (2935) from the indexing service provider. If the document fileis still in the pending folder, the document file is renamed (2940)according to the definition in the renamed file and may be move to aspecified server location. In an embodiment, the structured message filemay also be moved (2945) to a specified location. In one embodiment, oneor more of the files may be moved to a database or database inbox. In anembodiment, the indexing recipient system may notify the indexingservice provider that the files have been delivered and processed(2950). In the depicted embodiment, the indexing recipient system mayrepeat the process for all pending document files for that package. Ifthere are no remaining files to be processed (2950), the indexing systemrecipient system may delete the confirmation file. In an embodiment, aconfirmation file may be a zipped and encrypted package that containsstructured messages, such as HL-7 messages, and a rename file, which maybe an XML file, that explains how the original files on the clientmachine are to be renamed and where they are to be stored. In anembodiment, the document files, the structured message, or both may bestored so as to be accessed by a database client, such as CentricityEMR®.

In an embodiment, the array of strings of the document file, which maybe construed to be a part of the document file, may also be indexed withthe document file, such as in the case when the document file is animage or audio file and the associated data was created by convertingthe document file. In an embodiment, all document files obtained by thefirst computing system 101 may be stored into a common folder orlocation. The files may be stored locally, such as on storage device 304on first computing system 101, or on a remote device or network, such asstorage device 140, network 145, and/or remote network 150. In anembodiment, the document files may be stored within database system 110.In one embodiment, the document files may be indexed according to aunique identifier, which identifier may be one or more of the stringsfrom the array or strings or one or more data field elements for therecord matched to the document file.

FIG. 30 graphically illustrates an exemplary file structure for indexinga plurality of files according to an embodiment of the presentinvention. As illustrated in FIG. 30, after a document file has beensuccessfully identified, it may be moved from an unindexed folder 3005to a folder associated with that individual or organization. Forexample, the received file 400 may be stored in a folder associated withMary Alamb. In an embodiment, the folders 710 x may be uniquelyidentified by an account number, patient name, or the like.

In an alternative embodiment, instead of or in addition to indexing thereceived files by storing them into specific folders or locations, thereceived file may be indexed by using of a pointer or link to thereceived data file. In an embodiment, a database indexes the filepointer or file link. In one embodiment, the database may be part of thereference database 100. For example, one of the fields of the referencedatabase 100 may include file location information. Thus, the receivedfile may be indexed by associating or linking its storage location tothe matched record.

In an embodiment, first or second computing system 101/201 may place thedocument file and or associated data (such as structured message file,array of strings, etc.) in a predefined location for import into anelectronic record or other database software application. Accordingly, auser of the electronic record or other database software application canaccess and view the data using the electronic record or other databasesoftware application. One skilled in the art of information managementwill recognize other ways for indexing and storing the files, which arewithin the scope of the present invention.

Exemplary Embodiments of Account Services and Billing

Embodiment of the present invention may include archiving and retrievalservices for an indexing recipient. As noted above, embodiment of thepresent invention may include archiving services such as for cases ofmissing files during the indexing process (see, e.g., FIG. 29, steps2930-2935). Indexing service provider may also maintain copies of allfiles related to the indexing for an indexing recipient, include but notlimited to, document files, array of strings, reference databases,structured messages, rename files, additional data, composite messages,and may also maintained file space for other files for an indexingrecipient. One of more of these files may be in the event of lost orcorrupted data in the indexing recipient system.

Exemplary Embodiments of Account Services and Billing

As noted previously, embodiment of the present invention may includebilling services for billing indexing recipients and third parties.Billing services may include billing for indexing services, archivingservices, messaging services, account services, observational services,error correction services, other services described herein, and othercosts and fees. Embodiments of the present invention may also includebilling associated with financial events and/or marketing events.

Associate with a Financial Event

In embodiments, one or more of the steps performed according to thepresent invention may be associated with an individual and/ororganization for the purposes of billing or financial event or events.The billing or financial event may be for the user or operator of firstcomputing system 101, second computing system 201, or may be performedon behalf of another individual or organization. Consider, for example,the document file 400 from XYZ Laboratories, a medical diagnosticslaboratory, and assume that the document file 400 has been successfullymatched to a patient, Mary Alamb. In one embodiment, the matching of thedocument file 400 to a record (in this case a patient record), maytrigger a message that an invoice needs to be sent to Ms. Alamb'sinsurance provider or a message that XYZ Laboratories needs to be paidfor services performed. In one embodiment, an invoice may beautomatically sent to Ms. Alamb's insurance carrier for the servicesperformed. Additionally, in an embodiment, specific billing codes mayprovided to the insurance company. In an embodiment, each instance afile is received and indexed or processed according to the presentinvention, a user of the indexing or processing services may be billedfor such usage. One skilled in the art will recognize that otherconfigurations may beneficially employ or be linked to financial eventsand are within the scope of the present invention.

Associate with a Marketing or Advertising Event

In embodiments, one or more of the steps performed according to thepresent invention may be associated with an individual and/ororganization for the purpose of marketing or advertising. In anembodiment, the correlation between content data in the document fileand an individual or organization may be used for marketing andadvertising purposes. Consider, for example, document files containinginformation related to goods or services utilized by an individual ororganization. In an embodiment, that information may be used to provideadvertising or marketing services to that individual or organization ormay be provided to advertising or marketing organizations. In anotherembodiment, aggregate information may be provided to advertising ormarketing organizations. One skilled in the art will recognize thatother configurations may beneficially employ or be linked to advertisingor marketing events and are within the scope of the present invention.

While the invention is susceptible to various modifications andalternative forms, specific examples thereof have been shown in thedrawings and are herein described in detail. It should be understood,however, that the invention is not to be limited to the particular formdisclosed, but to the contrary, the invention is to cover allmodifications, equivalents, and alternatives falling within the scope ofthe appended claims.

In addition, embodiments of the present invention further relate tocomputer products with a computer-readable medium that have computercode thereon for performing various computer-implemented operations. Themedia and computer code may be those specially designed and constructedfor the purposes of the present invention, or they may be of the kindwell known and available to those having skill in the relevant arts.Examples of computer-readable media include, but are not limited to:magnetic media such as hard disks, floppy disks, and magnetic tape;optical media such as CD-ROMs and holographic devices; magneto-opticalmedia; and hardware devices that are specially configured to store or tostore and execute program code, such as application-specific integratedcircuits (ASICs), programmable logic devices (PLDs) and ROM and RAMdevices. Examples of computer code include machine code, such asproduced by a compiler, and files containing higher level code that areexecuted by a computer using an interpreter.

We claim:
 1. A processor-implemented method for identifying a documentfile comprising: responsive to locating a recognized set of charactersin a document file comprising a plurality of characters, using therecognized set of characters as an anchor point and performing the stepscomprising: selecting an examination set of characters from the documentfile, the examination set being selected based upon proximity to theanchor point; and searching the examination set for one or moreindicators to assist in uniquely identifying the document file.